A note: a due-window assignment problem on parallel identical machines

作者：Mosheiov G^*; Sarig A

来源：Journal of the Operational Research Society, 2011, 62(1): 238-241.

DOI：10.1057/jors.2009.179

• scheduling
• parallel machines
• earliness-tardiness
• due-window
• assignment problem

We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n(4))) solution procedure. Journal of the Operational Research Society (2011) 62, 238-241. doi:10.1057/jors.2009.179 Published online 3 March 2010

• 出版日期2011-1