Predictive/reactive scheduling with controllable processing times and earliness-tardiness penalties

IIE Transactions (Institute of Industrial Engineers)

Volumn 41, Issue 12, 2009, Pages 1080-1095

  Turkcan, Ayten ^a   Akturk, M Selim ^b   Storer, Robert H ^c  

^a Purdue University   (United States)

^b BILKENT UNIVERSITY   (Turkey)

^c Lehigh University   (United States)

Author keywords

Controllable processing times; Earliness and tardiness; Reactive scheduling; Scheduling

Indexed keywords

A-STABILITY; CONTROLLABLE PROCESSING TIME; CONVEX FUNCTIONS; DUE DATES; EARLINESS AND TARDINESS; EARLINESS AND TARDINESS PENALTIES; EARLINESS-TARDINESS; IDLE TIME; INITIAL SCHEDULE; INTEGER PROGRAMMING MODELS; MACHINE BREAKDOWN; MACHINE ENVIRONMENT; MACHINE SCHEDULING PROBLEM; MANUFACTURING COST; NETWORK FLOW MODEL; OBJECTIVE FUNCTIONS; PIECEWISE LINEARIZATION; PREDICTIVE SCHEDULING; PROCESSING TIME; REACTIVE SCHEDULING; WEIGHTED EARLINESS;

COSTS; DYNAMIC PROGRAMMING; LINEARIZATION; MACHINERY; MANUFACTURE; OPTIMIZATION; SCHEDULING ALGORITHMS;

INTEGER PROGRAMMING;

EID: 70749158552     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170902905995     Document Type: Article

References (24)

1. Ahuja, R.K.,Magnanti, T.L. and Orlin, J.B. (1993) Network Flows: Theory, Algorithms, andApplications, Prentice Hall, Upper SaddleRiver, NJ.
2. Alidaee, B. and Ahmadian, A. (1993) Two parallel-machine sequencing problems involving controllable processing times. European Journal of Operational Research, 70, 335-341.
3. Avci, S. (2001) Algorithms for generalized nonregular scheduling problems. Ph.D. thesis, Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA.
4. Baker, K.R. and Scudder, G.D. (1990) Sequencing with earliness and tardiness penalties: A review. Operations Research, 38, 22-36.
5. Cattrysse,D.G. and vanWassenhove, L.N. (1992) A survey of algorithms for the generalized assignment problem. European Journal of Operational Research, 60, 260-272.
6. Chen, J.-Y. and Lin, S.-F. (2002) Minimizingweighted earliness and tardiness penalties in single-machine schedulingwith idle time permitted. Naval Research Logistics, 49, 760-780.
7. Cheng, T.C.E., Chen, Z.-L. and Li, C.-L. (1996) Parallel-machine scheduling with controllable processing times. IIE Transactions, 28, 177-180.
8. Fry, T.D., Armstrong, R.D. and Blackstone, J.H. (1984) Minimizing weighted absolute deviation in singlemachine scheduling. IIETransactions, 19, 445-450.
9. Gurel, S. and Akturk, M.S. (2007) Considering manufacturing cost and scheduling performance on a CNCturningmachine. European Journal of Operational Research, 177, 325-343.
10. Hoogeveen, J.A. and Van de Velde, S.L. (1996) A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. INFORMS Journal on Computing, 8, 402-412.
11. Kanet, J.J. and Sridharan, S.V. (2000) Scheduling with inserted idle time: Problem taxonomy and literature review. Operations Research, 48, 99-110.
12. Kedad-Sidhoum, S., Solis, Y.R. and Sourd, F. (2008) Lower bounds for the earliness-tardiness scheduling problem on parallel-machines with distinct due dates. European Journal of Operational Research, 189, 1305-1316.
13. Liman, S.D., Panwalkar, S.S. and Thongmee, S. (1997) A single machine scheduling problem with common due window and controllable processing times. Annals of Operations Research, 70, 145-154.
14. Panwalkar, S.S. and Rajagopalan, R. (1992) Single machine sequencing with controllable processing times. European Journal of Operational Research, 59, 298-301.
15. Shabtay,D. andKaspi,M.(2004) Minimizing the totalweighted flowtime in a single machine with controllable processing times. Computers & Operations Research, 31, 2279-2289.
16. Shabtay, D. and Kaspi, M. (2006) Parallel-machine scheduling with a convex resource consumption function. European Journal of Operational Research, 173, 92-107.
17. Shabtay, D., Kaspi, M. and Steiner, G. (2007) The no-wait two-machine flow-shop scheduling problem with convex resource-dependent processing times. IIE Transactions, 39, 539-557.
18. Shabtay, D. and Steiner, G. (2007) A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155, 1643-1666.
19. Sourd,F. (2005) Earliness-tardiness schedulingwith setup considerations. Computers & Operations Research, 32, 1849-1865.
20. Turkcan, A., Akturk, M.S. and Storer, R.H. (2003) Non-identical parallel CNC machine scheduling. International Journal of Production Research 41(10), 2143-2168.
21. Turkcan, A., Akturk, M.S. and Storer, R.H. (2007) Due date and cost-based FMS loading, scheduling and tool management. International Journal of Production Research, 45(5), 1183-1213.
22. Van den Akker, J.M., Hurkens, C.A.J. and Savelsbergh, M.W.P. (2000) Time-indexed formulations for singlemachine scheduling problems: Column generation. INFORMS Journal on Computing, 12(2), 111-124.
23. Vieira, G.E., Herrmann, J.W. and Lin, E. (2003) Rescheduling manufacturing systems: A framework of strategies, policies and methods. Journal of Scheduling, 6(1), 39-62.
24. Yano, C.A. and Kim, Y. (1991) Algorithms for a class of single machine weighted tardiness and earliness problems. European Journal of Operational Research, 52, 161-178.