Advanced search
Publication Cover
Journal of the Operational Research Society Volume 56, 2005 - Issue 1
Submit an article Journal homepage
194
Views
69
CrossRef citations to date
0
Altmetric
Theoretical Paper

Comparative evaluation of MILP flowshop models

E F Stafford JrDepartment of Economics and FinanceUniversity of Alabama in HuntsvilleHuntsvilleALUSACorrespondence[email protected]
,
F T TsengDepartment of Economics and FinanceUniversity of Alabama in HuntsvilleHuntsvilleALUSA
&
J N D GuptaDepartment of Accounting and Management Information SystemsUniversity of Alabama in HuntsvilleHuntsvilleALUSA
Pages 88-101 | Received 01 Sep 2003, Accepted 01 Apr 2004, Published online: 21 Dec 2017

Citations (69)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (11)

Levi R. Abreu, Marcelo S. Nagano & Bruno A. Prata. (2023) A new two-stage constraint programming approach for open shop scheduling problem with machine blocking. International Journal of Production Research 61:24, pages 8560-8579.
Read now
Bruno de Athayde Prata & Marcelo Seido Nagano. (2023) A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization 55:12, pages 2070-2083.
Read now
Wei-Wei Cui, Zhiqiang Lu, Binghai Zhou, Chen Li & Xiaole Han. (2016) A hybrid genetic algorithm for non-permutation flow shop scheduling problems with unavailability constraints. International Journal of Computer Integrated Manufacturing 29:9, pages 944-961.
Read now
V. Roshanaei, Ahmed Azab & H. ElMaraghy. (2013) Mathematical modelling and a meta-heuristic for flexible job shop scheduling. International Journal of Production Research 51:20, pages 6247-6274.
Read now
Sara Hatami, Rubén Ruiz & Carlos Andrés-Romano. (2013) The Distributed Assembly Permutation Flowshop Scheduling Problem. International Journal of Production Research 51:17, pages 5292-5308.
Read now
M. Mousakhani. (2013) Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness. International Journal of Production Research 51:12, pages 3476-3487.
Read now
M Kharbeche & M Haouari. (2013) MIP models for minimizing total tardiness in a two-machine flow shop. Journal of the Operational Research Society 64:5, pages 690-707.
Read now
B. Naderi, S.M.T. Fatemi Ghomi, M. Aminnayeri & M. Zandieh. (2011) A study on open shop scheduling to minimise total tardiness. International Journal of Production Research 49:15, pages 4657-4678.
Read now
Myoungsoo Ham, Young Hoon Lee & Sun Hoon Kim. (2011) Real-time scheduling of multi-stage flexible job shop floor. International Journal of Production Research 49:12, pages 3715-3730.
Read now
K Sheibani. (2010) A fuzzy greedy heuristic for permutation flow-shop scheduling. Journal of the Operational Research Society 61:5, pages 813-818.
Read now
F T Tseng & E F Stafford$suffix/text()$suffix/text(). (2008) New MILP models for the permutation flowshop problem. Journal of the Operational Research Society 59:10, pages 1373-1386.
Read now

Articles from other publishers (58)

Hajar Sadki, Said Aqil, Jabrane Belabid & Karam Allali. (2023) Multi-Objective Optimization Flow Shop Scheduling Problem Solving the Makespan and Total Flow Time with Sequence Independent Setup Time. Journal of Advanced Manufacturing Systems 23:01, pages 163-184.
Crossref
Saba Aghighi, Esmaeil Mehdizadeh & Seyed Taghi Akhavan Niaki. (2024) No-Wait Open-Shop Scheduling Problems with Reverse Flows. Journal of Engineering Research.
Crossref
Bruno A. Prata, Levi R. Abreu & Marcelo S. Nagano. (2024) A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness. Journal of Industrial and Management Optimization 0:0, pages 0-0.
Crossref
Sebastian Cáceres Gelvez, Thu Huong Dang & Adam N. Letchford. (2023) On some lower bounds for the permutation flowshop problem. Computers & Operations Research 159, pages 106320.
Crossref
Bahman Naderi, Rubén Ruiz & Vahid Roshanaei. (2023) Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook. INFORMS Journal on Computing 35:4, pages 817-843.
Crossref
Jabrane Belabid, Said Aqil & Karam Allali. (2022) Nash equilibrium inspired greedy search for solving flow shop scheduling problems. Applied Intelligence 53:11, pages 13415-13431.
Crossref
Pakkaporn Saophan, Warut Pannakkong, Raveekiat Singhaphandu & Van-Nam Huynh. (2023) Rapid Production Rescheduling for Flow Shop Under Machine Failure Disturbance Using Hybrid Perturbation Population Genetic Algorithm-Artificial Neural Networks (PPGA-ANNs). IEEE Access 11, pages 75794-75817.
Crossref
Victor Fernandez-Viagas, Luis Sanchez-Mediano, Alvaro Angulo-Cortes, David Gomez-Medina & Jose Manuel Molina-Pariente. (2022) The Permutation Flow Shop Scheduling Problem with Human Resources: MILP Models, Decoding Procedures, NEH-Based Heuristics, and an Iterated Greedy Algorithm. Mathematics 10:19, pages 3446.
Crossref
Bruno de Athayde Prata, Victor Fernandez-Viagas, Jose M. Framinan & Carlos Diego Rodrigues. (2022) Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. Computers & Operations Research 145, pages 105880.
Crossref
Mohamed-Naceur Azaiez, Anis Gharbi, Imed Kacem, Yosra Makhlouf & Malek Masmoudi. (2022) Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling. Computers & Industrial Engineering 168, pages 108040.
Crossref
Alex Paranahyba de Abreu & Helio Yochihiro Fuchigami. (2022) An efficiency and robustness analysis of warm-start mathematical models for idle and waiting times optimization in the flow shop. Computers & Industrial Engineering 166, pages 107976.
Crossref
Pakkaporn Saophan & Warut Pannakkong. 2022. Integrated Uncertainty in Knowledge Modelling and Decision Making. Integrated Uncertainty in Knowledge Modelling and Decision Making 279 290 .
Levi R. Abreu, Roberto F. Tavares-Neto & Marcelo S. Nagano. (2021) A new efficient biased random key genetic algorithm for open shop scheduling with routing by capacitated single vehicle and makespan minimization. Engineering Applications of Artificial Intelligence 104, pages 104373.
Crossref
Bahman Naderi, Vahid Roshanaei, Mehmet A. Begen, Dionne M. Aleman & David R. Urbach. (2021) Increased Surgical Capacity without Additional Resources: Generalized Operating Room Planning and Scheduling. Production and Operations Management 30:8, pages 2608-2635.
Crossref
Kaveh Sheibani. 2021. Advanced Models and Tools for Effective Decision Making Under Uncertainty and Risk Contexts. Advanced Models and Tools for Effective Decision Making Under Uncertainty and Risk Contexts 254 275 .
Thamarassery Abduljaleel Jessin, Sakthivel Madankumar & Chandrasekharan Rajendran. (2020) Permutation flowshop scheduling to obtain the optimal solution/a lower bound with the makespan objective. Sādhanā 45:1.
Crossref
Qi Sun, Jianping Dou & Canran Zhang. (2020) Robust optimization of Flow Shop Scheduling with Uncertain Processing Time. Robust optimization of Flow Shop Scheduling with Uncertain Processing Time.
Kathrin Maassen, Paz Perez-Gonzalez & Lisa C. Günther. (2020) Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling. Computers & Operations Research 121, pages 104965.
Crossref
Paz Perez-Gonzalez, Victor Fernandez-Viagas & Jose M. Framinan. (2020) Permutation flowshop scheduling with periodic maintenance and makespan objective. Computers & Industrial Engineering 143, pages 106369.
Crossref
Tamer F. Abdelmaguid. (2020) Bi-Objective Dynamic Multiprocessor Open Shop Scheduling: An Exact Algorithm. Algorithms 13:3, pages 74.
Crossref
Jabrane Belabid, Said Aqil & Karam Allali. (2020) Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time. Journal of Applied Mathematics 2020, pages 1-11.
Crossref
Kaveh Sheibani. (2019) An Integrated Heuristic for Machine Sequencing With Specific Reference to the Permutation Flow-Shop Scheduling Problem. International Journal of Strategic Engineering 2:2, pages 1-8.
Crossref
Kenneth R. Baker & Dan Trietsch. 2018. Principles of Sequencing and Scheduling. Principles of Sequencing and Scheduling 283 317 .
Saad Louaqad & Oulaid Kamach. (2018) A disjunctive graph for the Job Shop Problem with Transport and blocking no wait constraints. A disjunctive graph for the Job Shop Problem with Transport and blocking no wait constraints.
Zhijun Xu, Dehua Xu, Jie He, Qi Wang, Aihua Liu & Junfang Xiao. (2017) Mixed Integer Programming Formulations for Two-Machine Flow Shop Scheduling with an Availability Constraint. Arabian Journal for Science and Engineering 43:2, pages 777-788.
Crossref
Kaveh Sheibani. (2017) Fuzzy Greedy Search. International Journal of Applied Management Sciences and Engineering 4:2, pages 1-12.
Crossref
T. Hajba, Z. Horváth, C. Kiss-Tóth & J. Jósvai. 2017. Math for the Digital Factory. Math for the Digital Factory 163 182 .
Sergio Gomez Morales & Débora Pretti Ronconi. (2015) Formulações matemáticas e estratégias de resolução para o problema job shop clássico. Production 26:3, pages 614-625.
Crossref
Tamás Hajba & Zoltán Horváth. (2014) MILP models for the optimization of real production lines. Central European Journal of Operations Research 23:4, pages 899-912.
Crossref
Sara Hatami, Ruben Ruiz & Carlos Andres-Romano. (2015) Heuristics for a Distributed Parallel Machine Assembly Scheduling Problem with eligibility constraints. Heuristics for a Distributed Parallel Machine Assembly Scheduling Problem with eligibility constraints.
H. M. Emrul Kays, A. N. M. Karim, M. L. R. Varela, A. S. Santos & A. M. Madureira. (2015) An integer programming approach for balancing and scheduling in extended manufacturing environment. An integer programming approach for balancing and scheduling in extended manufacturing environment.
Sara Hatami, Rubén Ruiz García & Carlos Andrés Romano. (2015) The Distributed Assembly Parallel Machine Scheduling Problem with eligibility constraints.. International Journal of Production Management and Engineering 3:1, pages 13.
Crossref
Safwan Altarazi & Omar Yasin. 2015. Modelling, Computation and Optimization in Information Systems and Management Sciences. Modelling, Computation and Optimization in Information Systems and Management Sciences 283 294 .
B. Naderi & M. Zandieh. (2014) Modeling and scheduling no-wait open shop problems. International Journal of Production Economics 158, pages 256-266.
Crossref
B. Naderi, Sheida Gohari & M. Yazdani. (2014) Hybrid flexible flowshop problems: Models and solution methods. Applied Mathematical Modelling 38:24, pages 5767-5780.
Crossref
B. Naderi, M. Zandieh & M. Yazdani. (2014) Polynomial time approximation algorithms for proportionate open‐shop scheduling. International Transactions in Operational Research 21:6, pages 1031-1044.
Crossref
Iiro Harjunkoski, Christos T. Maravelias, Peter Bongers, Pedro M. Castro, Sebastian Engell, Ignacio E. Grossmann, John Hooker, Carlos Méndez, Guido Sand & John Wassick. (2014) Scope for industrial applications of production scheduling models and solution methods. Computers & Chemical Engineering 62, pages 161-193.
Crossref
Tamás Hajba & Zoltán Horváth. (2012) New effective MILP models for PFSPs arising from real applications. Central European Journal of Operations Research 21:4, pages 729-744.
Crossref
Kan Fang, Nelson A. Uhan, Fu Zhao & John W. Sutherland. (2013) Flow shop scheduling with peak power consumption constraints. Annals of Operations Research 206:1, pages 115-145.
Crossref
Kenneth R. Baker. (2013) Computational results for the flowshop tardiness problem. Computers & Industrial Engineering 64:3, pages 812-816.
Crossref
Bahman Naderi, Esmaeil Najafi & Mehdi Yazdani. (2012) An electromagnetism-like metaheuristic for open-shop problems with no buffer. Journal of Industrial Engineering International 8:1.
Crossref
Débora P. Ronconi & Ernesto G. Birgin. 2012. Just-in-Time Systems. Just-in-Time Systems 91 105 .
Bahman Naderi, S. M. T. Fatemi Ghomi, M. Aminnayeri & M. Zandieh. (2010) Modeling and scheduling open shops with sequence-dependent setup times to minimize total completion time. The International Journal of Advanced Manufacturing Technology 53:5-8, pages 751-760.
Crossref
B. Naderi, S.M.T. Fatemi Ghomi, M. Aminnayeri & M. Zandieh. (2011) Scheduling open shops with parallel machines to minimize total completion time. Journal of Computational and Applied Mathematics 235:5, pages 1275-1287.
Crossref
Janick V. Frasch, Sven Oliver Krumke & Stephan Westphal. 2011. Theory and Practice of Algorithms in (Computer) Systems. Theory and Practice of Algorithms in (Computer) Systems 127 138 .
Kenneth R. Baker & Brian Keller. (2010) Solving the single-machine sequencing problem using integer programming. Computers & Industrial Engineering 59:4, pages 730-735.
Crossref
B. Naderi, M. Jenabi, S.M.T. Fatemi Ghomi & Davoud Talebi. (2010) An electromagnetism-like metaheuristic for sequence dependent open shop scheduling. An electromagnetism-like metaheuristic for sequence dependent open shop scheduling.
Li-Man Liao & Ching-Jen Huang. (2010) Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness. Applied Mathematics and Computation 217:2, pages 557-567.
Crossref
B. Naderi & Rubén Ruiz. (2010) The distributed permutation flowshop scheduling problem. Computers & Operations Research 37:4, pages 754-768.
Crossref
B. Naderi, A. Ahmadi Javid & F. Jolai. (2009) Permutation flowshops with transportation times: mathematical models and solution methods. The International Journal of Advanced Manufacturing Technology 46:5-8, pages 631-647.
Crossref
Myoungsoo Ham, Young Hoon Lee & John W. Fowler. (2009) Integer programming-based real-time scheduler in semiconductor manufacturing. Integer programming-based real-time scheduler in semiconductor manufacturing.
Celso S. Sakuraba, Débora P. Ronconi & Francis Sourd. (2009) Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. Computers & Operations Research 36:1, pages 60-72.
Crossref
Ali Husseinzadeh Kashan & Behrooz Karimi. (2008) An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines. The International Journal of Advanced Manufacturing Technology 40:5-6, pages 582-594.
Crossref
S.J. Sadjadi, M.B. Aryanezhad & Mohsen Ziaee. (2008) The General Flowshop Scheduling Problem: Mathematical Models. Journal of Applied Sciences 8:17, pages 3032-3037.
Crossref
Marta C. Gomes, Ana Barbosa-Povoa & Augusto Q. Novais. (2008) Scheduling of job shop, make-to-order industries with recirculation and assembly: a MILP approach. Scheduling of job shop, make-to-order industries with recirculation and assembly: a MILP approach.
M. M. Mashhadi, E. F. Stafford & F. T. Tseng. (2007) Development of a new model for the flowshop problem. Development of a new model for the flowshop problem.
Yu Liu & I.A. Karimi. (2007) Scheduling multistage, multiproduct batch plants with nonidentical parallel units and unlimited intermediate storage. Chemical Engineering Science 62:6, pages 1549-1566.
Crossref
Mohsen Ziaee & S.J. Sadjadi. (2007) Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling. Applied Mathematics and Computation 185:1, pages 218-228.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.