Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
Débora P. Ronconi () and
Ernesto G. Birgin ()
Additional contact information
Débora P. Ronconi: University of São Paulo
Ernesto G. Birgin: University of São Paulo
Chapter Chapter 5 in Just-in-Time Systems, 2012, pp 91-105 from Springer
Abstract:
Abstract 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.
Keywords: Flowshop Scheduling Problem; Flow Shop; Tardiness; Unlimited Buffer; Consecutive Jobs (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (3)
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-1123-9_5
Ordering information: This item can be ordered from
http://www.springer.com/9781461411239
DOI: 10.1007/978-1-4614-1123-9_5
Access Statistics for this chapter
More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().