Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times
Authors:
- 16 April 2021
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Asia-Pacific Journal of Operational Research
- Vol. 39 (02)
Abstract
Scheduling problems with variable processing times and past-sequence-dependent delivery times are considered on a single-machine. The delivery times of jobs depend on their waiting times of processing. A job’s actual processing time depends on its position in a sequence, its starting time and its allocation of non-renewable resources. Under the linear resource consumption function, the goal (version) is to determine the optimal sequence and optimal resource allocation such that the sum of scheduling cost and total resource consumption cost is minimized. Under the convex resource consumption function, three versions of the scheduling cost and total resource consumption cost are discussed. We prove that these four versions can be solved in polynomial time, respectively. Some applications are also given by using the scheduling cost, which involve the makespan, total completion time, total absolute differences in completion times (TADC), and total absolute differences in waiting times (TADW).Keywords
This publication has 28 references indexed in Scilit:
- Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effectsApplied Mathematical Modelling, 2013
- Single-machine scheduling with past-sequence-dependent delivery times and release timesInformation Processing Letters, 2012
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCEAsia-Pacific Journal of Operational Research, 2012
- New results on single-machine scheduling with past-sequence-dependent delivery timesTheoretical Computer Science, 2012
- Scheduling jobs with chain precedence constraints and deteriorating jobsJournal of the Operational Research Society, 2011
- Single-machine scheduling with past-sequence-dependent delivery times and learning effectJournal of the Chinese Institute of Industrial Engineers, 2011
- Single-machine scheduling with learning effect and resource-dependent processing timesComputers & Industrial Engineering, 2010
- Single-machine scheduling problems with past-sequence-dependent delivery timesInternational Journal of Production Economics, 2010
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion timesComputers & Operations Research, 2008
- A survey of scheduling with controllable processing timesDiscrete Applied Mathematics, 2007