Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time

• Published in: The Journal of the Operational Research Society Vol. 65; no. 1; pp. 1 - 13
• Main Authors: Yin, Y, Cheng, T C E, Wu, C-C, Cheng, S-R
• Format: Journal Article
• Language: English
• Published: London Taylor & Francis 01.01.2014; Palgrave Macmillan; Palgrave Macmillan UK; Taylor & Francis Ltd
• Subjects: Algorithms; Assignment problem; Business and Management; Commercial production; Consumption function; controllable processing times; Cost allocation; due window assignment; Employment; Fines & penalties; Flow control; General Paper; General Papers; Job shops; Lateness; Machinery; Management; Minimization of cost; Objective functions; Operations management; Operations research; Operations Research/Decision Theory; Production scheduling; resource allocation; Scheduling; Sequencing; Studies; scheduling; controllable processing times; resource allocation; due window assignment

In this paper, we consider single-machine due window assignment and scheduling with a common flow allowance and controllable job processing times, subject to unlimited or limited resource availability. Due window assignment with a common flow allowance means that each job has a job-dependent due win...