Job-Dependent Due-Window Assignment Based On A Common Flow Allowance

• Autorzy: Mosheiov G. , Oron D.
• Języki publikacji: EN

Abstrakty

EN

A due-window assignment model is an extension of the classical due-date assignment, where a time interval (rather than a time point) is determined, such that jobs completed within this time interval are not penalized. Jobs completed outside the due-window are penalized according to their earliness/tardiness values. In this paper we solve a job-dependent due-window assignment problem, assuming a common flow allowance. We introduce an efficient 0(n log n) solution algorithm (where n is the number of jobs). We then consider the case of position-dependent processing times, showing that the problem remains solvable in polynomial time.

Słowa kluczowe

EN

scheduling; due window assignment; Earliness-Tardiness Cost; Common Flow Allowance; Position-Dependent Processing Times

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Foundations of Computing and Decision Sciences
• Rocznik: 2010
• Tom: Vol. 35, No. 3
• Strony: 185--195
• Opis fizyczny: Bibliogr. 11 poz.

Twórcy

autor

Mosheiov G.

autor

Oron D.

• School of Business Administration, The Hebrew University, Jerusalem 91905, Israel

Bibliografia

• [1] Adamopoulos G.I., Pappis C.P., Single machine scheduling with flow allowance, Journal of the Operational Research Society, 47, 1996, 1280-1285.
• [2] Biskup D., Single Machine scheduling with learning considerations, European Journal of Operational Research, 115, 1999, 173-178.
• [3] Cheng T.C.E., Optimal slack due-date determination and sequencing., Engineering Costs and Production Economics, 10, 1986,305-309.
• [4] Cheng T.C.E., Optimal assignment of slack due-dates and sequencing in a single machine shop, Applied Maths Letters, 2, 1989, 333-335.
• [5] Gordon V.S., A note on optimal assignment of slack due-dates in single-machine scheduling, European Journal of Operational Research, 70, 1993, 311-315.
• [6] Gordon V.S., Proth J.M., 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.
• [7] Hardy G.H., Littlewood L.E., Polya G., Inequalities. Cambridge University Press 1967, Cambridge.
• [8] Karacapilidis N.I., Pappis C.P., Optimal due-date determination and sequencing n jobs on a single machine using the SLK method, Computers in Industry, 21, 1993, 335-339.
• [9] Liman S.D., Panwalker S.S., 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.
• [10] Mosheiov G., Sidney J.B., Scheduling with general job-dependent learning curves, European Journal of Operational Research, 147, 2003, 665-670.
• [11] Panwalkar S.S., Smith M.L., Seidmann A., Common due-date assignment to minimize total penalty for the one machine sequencing problem, Operations Research, 30, 1982, 391-399.