Single machine due window assignment resource allocation scheduling with job-dependent learning effect
- 43 Downloads
This paper deals with a single machine common due window assignment resource allocation scheduling problem with job-dependent learning effect. The objective is to find the due window starting time, a due window size, resource allocation and a job schedule such that total resource consumption cost is minimized subject to a cost function associated with the window location, window size, earliness, tardiness and makespan is less than or equal to a fixed constant number. We show that the problem can be solved in polynomial time. Some extensions of the problem are also given.
KeywordsScheduling Single-machine Due-window Resource allocation Learning effect
Mathematics Subject Classification90B35 68M20
This research was supported by the National Natural Science Foundation of China (Grant no. 71471120) and the Program for Liaoning Natural Science Foundation Research (Grant no. 201601177).
- 12.Wang, X.-Y., Li, L., Wang, J.-B.: Study on due-window scheduling with controllable processing times and learning effect. ICIC Express Lett. 10, 2913–2919 (2016)Google Scholar