No-wait two-machine permutation flow shop scheduling problem with learning effect, common due date and controllable job processing times
Authors:
- 12 September 2017
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 56 (6) , 2361-2369
Abstract
We consider a two-machine no-wait permutation flow shop common due date assignment scheduling problem where the processing time of a job is given as a function of its position in the sequence and its amount of resource allocated to this job. The common due date (CON) assignment method means that all the jobs are given a common due date. We need to make a decision on the common due date, resource allocation and the sequence of jobs to minimise total earliness, tardiness, common due date cost and total resource cost. We show that the problem remains polynomially solvable under the proposed model.Keywords
Funding Information
- National Natural Science Foundation of China (71501082)
- National Natural Science Foundation of China (71471057)
- National Natural Science Foundation of China (71271039)
- National Natural Science Foundation of China (71672019)
- Program for New Century Excellent Talents in University (NCET-13-0082)
- Program for New Century Excellent Talents in University (71672019)
This publication has 35 references indexed in Scilit:
- Scheduling problems under learning effects: classification and cartographyInternational Journal of Production Research, 2017
- Decision support for unrelated parallel machine scheduling with discrete controllable processing timesApplied Soft Computing, 2015
- Strong NP-hardness of scheduling problems with learning or aging effectAnnals of Operations Research, 2013
- Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activityOptimization Letters, 2012
- Single machine scheduling with precedence constraints and positionally dependent processing timesComputers & Operations Research, 2012
- Scheduling with due date assignment under special conditions on job processingJournal of Scheduling, 2011
- A state-of-the-art review on scheduling with learning effectsEuropean Journal of Operational Research, 2008
- A survey of the state-of-the-art of common due date assignment and scheduling researchEuropean Journal of Operational Research, 2002
- Due date assignment and scheduling: Slk, TWK and other due date assignment modelsProduction Planning & Control, 2002
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979