Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
Scheduling problems involving both earliness and tardiness costs have received significant attention in recent years. This type of problem became important with the advent of the just-in-time (JIT) concept, where early or tardy deliveries are highly discouraged. In this work we examine the flowshop scheduling problem with no storage constraints and with blocking in-process. In this latter environment, there are no buffers between successive machines; therefore, intermediate queues of jobs waiting in the system for their next operations are not allowed. Performance is measured by the minimization of the sum of earliness and tardiness of the jobs. Mixed-integer models that represent these scheduling flowshop problems are presented. The models are evaluated and compared in several problems using commercial known software.
This work was supported by PRONEX-CNPq/FAPERJ (E-26/171.1510/2006-APQ1), FAPESP (Grants 2006/53768-0, 2006/03496-3 and 2009/10241-0), and CNPq (308000/2009-9 and 304484/2007-5).
- 2.Brandimarte, P.: Neighbourhood search-based optimization algorithms for production scheduling: a survey. Running Series - Designing Production Order Scheduling Tools 5(2) (1992)Google Scholar
- 13.Reklaitis, G.V.: Review of scheduling of process operations. AIChE Symposium Series 78, 119–133 (1982)Google Scholar
- 14.Ronconi, D.P.: A contribution to the study of the flowshop problem minimizing the total tardiness. Ph.D. Dissertation (in portuguese), UNICAMP, Campinas, Brazil (1997)Google Scholar
- 18.Stafford, E.F., Tseng, F.T.,J. N., Gupta, J.N.D.: Comparative evaluation of MILP flowshop models. Journal of the Operational Research Society 56, 88–101 (2005)Google Scholar