Scheduling with a common due-window: Polynomially solvable cases

Information Sciences

Volumn 180, Issue 8, 2010, Pages 1492-1505

  Mosheiov, Gur ^a   Sarig, Assaf ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Common due window; Earliness tardiness cost; Linear programming; Scheduling

Indexed keywords

COMMON DUE-WINDOW; DUE-DATE ASSIGNMENT; DUE-WINDOW; EARLINESS-TARDINESS COST; EARLINESS-TARDINESS COSTS; FLOW-SHOPS; IDENTICAL MACHINES; JOB COMPLETION; JOB SEQUENCES; LINEAR PROGRAMS; NP-HARD; POLYNOMIAL-TIME; PROCESSING TIME; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE MACHINES; SOLVABLE CASE; WEIGHTED ABSOLUTE DEVIATION;

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; MACHINE SHOPS; MACHINERY; PARALLEL FLOW; POLYNOMIAL APPROXIMATION; SCHEDULING;

WINDOWS;

EID: 75149128051     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.11.042     Document Type: Article

References (23)

1. Baptiste P., and Schieber B. A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness. Journal of Scheduling 6 (2003) 395-404
2. Dyer M.E. Linear time algorithms for two and three-variable linear problems. SIAM Journal of Computing 13 (1984) 31-45
3. Gordon V., Proth J.M., and Chu C. A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research 139 (2002) 1-25
4. Hall N.G., Kubiak W., and Sethi S.P. Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Operations Research 39 (1991) 847-856
5. Hardy G.H., Littlewood J.E., and Polya G. Inequalities (1967), Cambridge University Press
6. Hsu W.L. Approximation algorithms for the assembly line crew scheduling problem. Mathematics of Operational Research 9 (1984) 376-383
7. In: Janiak A. (Ed). Scheduling in Computer and Manufacturing Systems (2006), WKL, Warsaw
8. Janiak A., Janiak W., and Marek M. Single processor scheduling problems with various models of a due window assignment. Bulletin of the Polish Academy of Sciences: Technical Sciences 57 (2009) 95-101
9. Janiak A., Y Kovalyov M., and Marek M. Soft due window assignment and scheduling on parallel machines. IEEE Transactions on Systems, Man and Cybernetics; Part A 37 (2007) 614-620
10. A. Janiak, M. Marek, Multi-machine scheduling problem with due interval assignment subject to generalized sum type criterion, Operations Research Proceedings, Springer-Verlag, 2002, pp. 207-212.
11. A. Janiak, M. Marek, Parallel processor scheduling problem with optimal due interval assignment, in: Proceedings of 3th International Conference on Parallel Computing Systems, 2004, pp. 383-387.
12. Janiak A., and Winczaszek M. A single processor scheduling problem with a common due window assignment. In: Fleuren H., Hertog D.d., and Kort P. (Eds). Operations Research (2005), Springer, Berlin 352-359
13. A. Janiak, M. Winczaszek, Optimal algorithm for parallel processor scheduling problem with due window assignment, in: S. Domek, R. Kaszynski (Eds), Proceedings of the 11th IEEE International Conference on Methods in Automation and Robotics, Miedzyzdroje, MMAR 2005, pp. 1085-1089.
14. Kanet J.J., and Sridharan V. Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research 48 (2000) 99-110
15. Kramer F.J., and Lee C.-Y. Due window scheduling for parallel machines. Mathematics and Computers Modeling 20 (1994) 69-89
16. Li C.-L., and Cheng T.C.E. The parallel machine min-max weighted absolute lateness scheduling problems. Naval Research Logistics 41 (1994) 33-46
17. Liman S.D., Panwalker S.S., and Thongmee S. Determination of a common due window location in a single machine scheduling problem. European Journal of Operational Research 93 (1996) 68-74
18. Liman S.D., Panwalker S.S., and Thongmee S. Common due window size and location determination in a single machine scheduling problem. Journal of the Operational Research Society 49 (1998) 1007-1010
19. Liman S.D., and Ramaswamy S. Earliness-tardiness with a common delivery window. Operations Research Letters 15 (1994) 195-203
20. Mosheiov G. Due-date assignment with asymmetric earliness-tardiness cost. Journal of the Operational Research Society 54 (2003) 1222-1224
21. Mosheiov G., and Oron D. Due window assignment with unit processing-time jobs. Naval Research Logistics 51 (2004) 1005-1017
22. Mosheiov G., and Shadmon M. Minmax earliness-tardiness costs with unit processing time jobs. European Journal of Operational Research 130 (2001) 638-652
23. Simons B., and Sipser M. On scheduling unit-length jobs with multiply release time/deadline intervals. Operations Research 32 (1984) 80-88