Scheduling identical jobs and due-window on uniform machines

作者：Mosheiov Gur^*; Sarig Assaf

来源：European Journal of Operational Research, 2010, 201(3): 712-719.

DOI：10.1016/j.ejor.2009.03.039

• Scheduling
• Earliness
• Tardiness
• Uniform machines
• Due-window

We extend a classical common due-window assignment problem to a setting of parallel uniform machines. jobs are assumed to have identical processing times. The objective is minimum earliness, tardiness, due-window starting time, and due-window size. We focus on the case of two machines. Despite the many (12) candidate schedules for optimality, an efficient constant time Solution is introduced.

• 出版日期2010-3-16