A mixed integer program for cyclic scheduling of flexible flow lines

• Autorzy: Sawik T.

Identyfikatory

DOI

10.2478/bpasts-2014-0014

• Języki publikacji: EN

Abstrakty

EN

A new mixed integer programming formulation is presented for cyclic scheduling in flow lines with parallel machines and finite in-process buffers, where a Minimal Part Set (MPS) in the same proportion as the overall production target is repetitively scheduled. The cycle of parts in an MPS is not determined a priori, but is obtained along with the optimal schedule for all parts. In addition to the cyclic scheduling, a cyclic-batch scheduling mode is introduced, where within the MPS the parts of one type are processed consecutively. Numerical examples are included and some results of computational experiments are reported.

Słowa kluczowe

EN

flexible flow line; cyclic scheduling; cyclic-batch scheduling; mixed-integer programming

• Wydawca: Polska Akademia Nauk, Wydział IV Nauk Technicznych
• Czasopismo: Bulletin of the Polish Academy of Sciences. Technical Sciences
• Rocznik: 2014
• Tom: Vol. 62, nr 1
• Strony: 121--128
• Opis fizyczny: Bibliogr. 11 poz., rys., tab.

Twórcy

autor

Sawik T.

• AGH University of Science & Technology, Department of Operations Research and Information Technology, 30 Mickiewicza Ave., 30-059 Kraków, Poland

Bibliografia

• [1] S.T. McCormick, M.L. Pinedo, S. Shenker, and B. Wolf, “Sequencing in an assembly line with blocking to minimize cycle time”, Operations Research 37, 925-936 (1989).
• [2] T. Sawik, “Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers”, Mathematical and Computer Modelling 31 (13), 39-52 (2000).
• [3] T. Sawik, “Mixed integer programming for scheduling surface mount technology lines”, Int. J. Production Research 39 (14), 3219-3235 (2001).
• [4] M. Magiera, “A relaxation heuristic for scheduling flowshops with intermediate buffers”, Bull. Pol. Ac.: Tech. 61 (4), 929-942 (2013).
• [5] T. Kis and E. Pesch, “A review of exact solution methods for the non-preemptive multiprocessor flowshop problem”, Eur. J. Operational Research 164 (3), 592-608 (2005).
• [6] I. Ribas, R. Leisten, and J.M. Framinan, “Review and classification of hybrid flowshop scheduling problems from a production system and a solutions procedure perspective”, Computers and Operations Research 37, 1439-1454 (2010).
• [7] E. Levner, V. Kats, D. Alcaide, and T.C.E. Cheng, “Complexity of cyclic scheduling problems: a state-of-the-art survey”, Computers and Industrial Engineering 59, 352-361 (2010).
• [8] T. Sawik, “Balancing and scheduling of surface mount technology lines”, Int. J. Production Research 40 (9), 1993-1991 (2002).
• [9] T. Sawik, “Batch vs. cyclic scheduling in flexible flow shops by mixed integer programming”, Int. J. Production Research 50 (18), 5017-5034 (2012).
• [10] S. Karabati and P. Kouvelis, “Cycle scheduling in flow lines: modeling observations, effective heuristics ad a cycle time minimization procedure”, Naval Research Logistics 43, 211-231 (1996).
• [11] P. Kouvelis and S. Karabati, “Cyclic scheduling in synchronous production lines”, IIE Transactions 31 (8), 709-719 (1999).