Single machine scheduling and due date assignment with positionally dependent processing times

European Journal of Operational Research

Volumn 198, Issue 1, 2009, Pages 57-62

  Gordon, Valery S ^a   Strusevich, Vitaly A ^b  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Common due date assignment; Positionally dependent processing times; Single machine scheduling; SLK due date assignment

Indexed keywords

MACHINERY; SUPPLY CHAINS; SYSTEMS ENGINEERING;

COMMON DUE DATE ASSIGNMENT; DUE DATES; DUE-DATE ASSIGNMENTS; OBJECTIVE FUNCTIONS; POLYNOMIAL-TIME DYNAMIC PROGRAMMING; POSITIONALLY DEPENDENT PROCESSING TIMES; SINGLE MACHINE SCHEDULING; SLK DUE DATE ASSIGNMENT; SUPPLY CHAIN SCHEDULING; TOTAL COSTS;

SCHEDULING;

EID: 62549112638     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.07.044     Document Type: Article

References (16)

1. Agnetis A., Hall N.G., and Pacciarelli D. Supply chain scheduling: Sequence coordination. Discrete Applied Mathematics 154 (2006) 2044-2063
2. Biskup D. Single-machine scheduling with learning considerations. European Journal of Operational Research 115 (1999) 173-178
3. Cheng T.C.E., Ding Q., and Lin B.M.T. A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research 152 (2004) 1-13
4. De P., Ghosh J.B., and Wells C.E. Optimal delivery time quotation and order sequencing. Decision Science 22 (1991) 379-390
5. Gordon V.S., Proth J.-M., and Strusevich V.A. Scheduling with due date assignment. In: Leung J.Y.-T. (Ed). Handbook of Scheduling: Algorithms, Models and Performance Analysis (2004), CRC Press, Boca Raton 21-1-21-22
6. Gordon, V.S., Potts, C.N., Strusevich, V.A., Whitehead, J.D., in press. Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation. Journal of Scheduling. doi:10.1007/s10951-008-0064-x.
7. Hall N.G., and Potts C.N. Supply chain scheduling: Batching and delivery. Operations Research 51 (2003) 566-584
8. Kahlbacher H.G., and Cheng T.C.E. Parallel machine scheduling to minimize costs for earliness and number of tardy jobs. Discrete Applied Mathematics 47 (1993) 139-164
9. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press, New York 85-103
10. Kuo W.-H., and Yang D.-L. Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research 174 (2006) 1184-1190
11. Mosheiov G. Scheduling problems with a learning effect. European Journal of Operational Research 132 (2001) 687-693
12. Mosheiov G. A note on scheduling deteriorating jobs. Mathematical and Computer Modelling 41 (2005) 883-886
13. Pinedo M.L. Planning and Scheduling in Manufacturing and Services (2005), Springer, Berlin
14. Shabtay D., and Steiner G. Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine. Manufacturing and Service Operations Management 9 (2007) 332-350
15. Wang J.-B. Flow shop scheduling jobs with position-dependent processing times. Journal of Applied Mathematics and Computing 18 (2005) 383-391
16. Wang J.-B., and Xia Z.-Q. Flow shop scheduling with a learning effect. Journal of the Operational Research Society 56 (2005) 1325-1330