Filters








1,807 Hits in 5.1 sec

A survey of due-date related single-machine with two-agent scheduling problem

Hongwei Li, Yuvraj Gajpal, C. R. Bector
2017 Journal of Industrial and Management Optimization  
We consider the following four main cases: 1) the earliness and tardiness, 2) the maximum lateness, 3) the number of tardy jobs and 4) the late work criteria.  ...  In this paper, we consider due-date related single machine scheduling problems, where two agents compete for utilizing a common processing resource (i.e. a single machine).  ...  We are thankful to the reviewers for their valuable comments. This research is supported by NSERC discovery Grant 318689.  ... 
doi:10.3934/jimo.2019005 fatcat:pc444d5wqffetdzxl5gg5mtn7m

Bicriterion scheduling with equal processing times on a batch processing machine

L.L. Liu, C.T. Ng, T.C.E. Cheng
2009 Computers & Operations Research  
In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria.  ...  Abstract In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria.  ...  Obviously, most of the bicriterion scheduling problems are strongly NP-complete even for the single-machine case.  ... 
doi:10.1016/j.cor.2007.07.007 fatcat:bxo6cjbs4rc6dmfn7hrwqc6b2a

Page 857 of The Journal of the Operational Research Society Vol. 59, Issue 6 [page]

2008 The Journal of the Operational Research Society  
Zhao and Tang (2005) considered the same actual processing time function ( pj =a; — bt) and presented an optimal algorithm to minimize the sum of earliness penalties subject to no tardy jobs.  ...  The objective is to determine the optimal due-date and schedule simultaneously to minimize the total of due-date, earliness and tardiness penalties.  ... 

M-machine SDST flow shop scheduling using modified heuristic genetic algorithm

A Dhingra, P Chandna
2010 International Journal of Engineering, Science and Technology  
In the present work, a modified heuristic based genetic algorithm (MHGA) has been developed for the aforesaid scheduling problem subject to the minimization of weighted sum of total weighted squared tardiness  ...  A computational analysis has been made to evaluate the performance of the proposed MHGA for upto 200 jobs and 20 machines problems.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their valuable suggestions in revising the manuscript.  ... 
doi:10.4314/ijest.v2i5.60151 fatcat:tq5jdlrabjagxnnnr7mzxkt72a

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Panneerselvam Senthilkumar, Sockalingam Narayanan
2010 Intelligent Information Management  
The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds.  ...  This paper presents a survey of single machine scheduling problem with uniform parallel machines.  ...  scheduling of non-preemptive jobs to minimize total earliness/tardiness.  ... 
doi:10.4236/iim.2010.28056 fatcat:cugkndehgrgedbxdjuga7mz7e4

Fuzzy bi-criteria scheduling on parallel machines involving weighted flow time and maximum tardiness

Kewal Krishan Nailwal, Deepak Gupta, Sameer Sharma, Yong Hong Wu
2015 Cogent Mathematics  
This paper considers a bi-criteria scheduling on parallel machines in fuzzy environment which optimizes the weighted flow time and maximum tardiness.  ...  So, a heuristic algorithm is proposed to find the optimal sequence of jobs processing on parallel machines so as to minimize the secondary criterion of maximum tardiness without violating the primary criterion  ...  On single machine bi-criteria, Smith (1956) was the first to consider minimization of weighted completion time subject to minimal value of T max .  ... 
doi:10.1080/23311835.2015.1019792 fatcat:sy3srdshovcnracwulccahfkhu

Some single-machine scheduling problems with general effects of learning and deterioration

Yunqiang Yin, Dehua Xu
2011 Computers and Mathematics with Applications  
It further shows that the problems to minimize the total weighted completion time, discounted total weighted completion time, maximum lateness, maximum tardiness, total tardiness and total weighted earliness  ...  This paper shows that the single-machine scheduling problems to minimize the makespan, sum of the kth power of completion times, total lateness and sum of earliness penalties (with a common due date) are  ...  Acknowledgements We wish to express our heart thanks to the referees for their interests in our work and spending their valuable times in reading this manuscript carefully and giving their valuable comments  ... 
doi:10.1016/j.camwa.2010.10.036 fatcat:ix7lsv7t2nhvng2nhozthityvu

Stochastic cell loading to minimize nT subject to maximum acceptable probability of tardiness

Gökhan Eğilmez, Gürsel A. Süer
2015 Journal of manufacturing systems  
The objective is to minimize the number of tardy jobs subject to maximum acceptable probability of tardiness (risk level).  ...  A job is called "tardy" if the probability of tardiness is greater than the risk level otherwise it is called early.  ...  Acknowledgements As the researchers, we would like to express our gratitude to the editor, Dr. Duffie for his timely responses, assistance and guidance during the reviewing process.  ... 
doi:10.1016/j.jmsy.2014.11.018 fatcat:yweevupsbzghllaryzkhs5memq

Page 354 of The Journal of the Operational Research Society Vol. 58, Issue 3 [page]

2007 The Journal of the Operational Research Society  
Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time. J Op/ Res Soc 54: 1263-1274. Ho JC and Chang YL (1991).  ...  Scheduling parallel machines to minimize total weighted and unweighted tardiness. Comput Opns Res 24: 775-788. Azizoglu M and Kirca O (1998). Tardiness minimization on parallel machines.  ... 

Single machine common flow allowance scheduling with controllable processing times

Ji-Bo Wang
2006 Journal of Applied Mathematics and Computing  
The objective is to determine the optimal sequence, the optimal common flow allowance and the optimal processing time compressions to minimize a total penalty function based on earliness, tardiness, common  ...  In this paper, we consider single machine SLK due date assignment scheduling problem in which job processing times are controllable variables with linear costs.  ...  Van Wassenhove and Baker [14] considered single machine scheduling problems in which the objective function is to minimize the maximum completion penalty.  ... 
doi:10.1007/bf02896403 fatcat:5sgkk2y3hfdgfctkq3c6yb2qu4

A note on due-date assignment and single-machine scheduling with deteriorating jobs

W-H Kuo, D-L Yang
2008 Journal of the Operational Research Society  
Zhao and Tang (2005) considered the same actual processing time function ( pj =a; — bt) and presented an optimal algorithm to minimize the sum of earliness penalties subject to no tardy jobs.  ...  The objective is to determine the optimal due-date and schedule simultaneously to minimize the total of due-date, earliness and tardiness penalties.  ... 
doi:10.1057/palgrave.jors.2602396 fatcat:ejk7t5lplfbxhcksaobi6baate

A bicriteria scheduling with sequence-dependent setup times

Tamer Eren, Ertan Güner
2006 Applied Mathematics and Computation  
The objective function of the problem is minimization of the weighted sum of total completion time, maximum tardiness and maximum earliness.  ...  In this paper a multicriteria scheduling problem with sequence-dependent setup times on a single machine is considered.  ...  The problem with the objective of minimizing the weighted sum of total completion time, maximum tardiness and maximum earliness with sequencedependent setup times on a single machine is considered in this  ... 
doi:10.1016/j.amc.2005.11.112 fatcat:2gmnjn5jvzdalbcc6afoxk5tty

Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents

B Mor, G Mosheiov
2014 Journal of the Operational Research Society  
The goal is to minimize the value of the objective function of one agent, subject to an upper bound on the value of the objective function of the second agent.  ...  Three objective functions of the first agent are considered: minimum maximum cost of all the jobs, minimum total completion time, and minimum number of tardy jobs.  ...  of the first agent, subject to maximum weighted deviation of the second agent), Yin et al (2012a) (minimizing earliness measures of the first agent subject to an upper bound on the earliness of the second  ... 
doi:10.1057/jors.2013.9 fatcat:f57nyvtnyjbaxdty5yekmfppre

Page 2354 of Mathematical Reviews Vol. , Issue 2000c [page]

2000 Mathematical Reviews  
The objective is to minimize the expected costs of earliness and tardiness, where the cost for an early job is a general function of its earliness while the cost for a tardy job is a fixed charge.  ...  Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem.  ... 

Page 556 of Mathematical Reviews Vol. , Issue 89A [page]

1989 Mathematical Reviews  
Summary: “We consider the single machine scheduling problem where the objective is to minimize the total weighted earliness subject to no tardy jobs.  ...  89a:90066 90B35 Chand, Suresh (1-PURD-A); Schneeberger, Hans Single machine scheduling to minimize weighted earliness subject to no tardy jobs. European J. Oper. Res. 34 (1988), no. 2, 221-230.  ... 
« Previous Showing results 1 — 15 out of 1,807 results