A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times

IIE Transactions (Institute of Industrial Engineers)

Volumn 31, Issue 2, 1999, Pages 125-134

  Laguna, Manuel ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; INVENTORY CONTROL; JOB ANALYSIS; PROBLEM SOLVING; SCHEDULING;

MIXED INTEGER PROGRAMMING (MIP); SEQUENCE-DEPENDENT SETUP TIMES;

PRODUCTION CONTROL;

EID: 0032682335     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179908969811     Document Type: Article

References (16)

1. Monma, C.L., and Potts, C.N., (1989) On the complexity of scheduling with batch setup times. Operations Research, 37, 798–804.
2. Magnanti, T.L., and Vachani, R., (1990) A strong cutting plane algorithm for production scheduling with changeover costs. Operations Research, 38, 456–473.
3. Unal, AT., and Kiran, A.S., (1992) Batch sequencing. HE Transactions, 24, 73–83.
4. Kondili, E., Pantelides, C.C., and Sargent, R.W.H., (1993) A general algorithm for short-term scheduling of batch operations-I. MILP formulation. Computers and Chemical Engineering, 17, 211–227.
5. Shah, N., Pantelides, C.C., and Sargert, R.W.H., (1993) A general algorithm for short-term scheduling of batch operations-II. computational issues. Computers and Chemical Engineering, 17, 229–244.
6. Shapiro, J., (1993) Mathematical programming models and methods for production planning and scheduling, in Logistics of Production and Inventory, Graves, S.C., Rinnooy Kan, A.H.G. and Zipkin, P.H. (eds.), North Holland, Amsterdam, pp. 371–443.
7. Kudva, G., Elkamel, A., and Reklaitis, G.V., (1994) Heuristic algorithm for scheduling batch and semi-continuous plants with production deadlines intermediate storage limitations and equipment changeover costs. Computers and Chemical Engineering, 18, 859–875.
8. Ovacik, I.M., and Uzsoy, R., (1994) Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times. International Journal of Production Research, 32, 1243–1263.
9. Baker, K.R., (1974) Introduction to Sequencing and Scheduling, Wiley, New York.
10. Dauzère-Péres and Laserre (1994) An integrated approach in production planning and scheduling, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin.
11. Unal, A.T., Uzsoy, R., and Kiran, A.S., (1997) Rescheduling on a single machine with part-type dependent setup times and deadlines. Annals of Operations Research, 70, 93–113.
12. Ovacik, J.M., and Uzsoy, R., (1995) Rolling horizon procedures for dynamic parallel machine problems with sequence dependent setup times. International Journal of Production Research, 33, 3173–3192.
13. Aragone, L.S., and Gonzalez, R.L.V., (1997) Fast computational procedure for solving multi-item single-machine lot scheduling optimization problems. Journal of Optimization Theory and Applications, 93, 491–551.
14. Evans, J., and Minieka, E., (1992) Optimization Algorithms for Networks and Graphs, 2nd edn., Dekker, New York. ch. 9.
15. Hackman, ST., and Leachman, R.C., (1989) A general framework for modeling production. Management Science, 35, 478–495.
16. Glover, F., and Laguna, M., (1997) Tabu Search, Kluwer, Boston, MA.