Advanced search
Publication Cover
International Journal of Systems Science Volume 28, 1997 - Issue 1
Submit an article Journal homepage
1,073
Views
91
CrossRef citations to date
0
Altmetric
Original Articles

A study of integer programming formulations for scheduling problems

CHAO-HSIEN PAN Department of Industrial Management, National Taiwan Institute of Technology, 43, Keelung Road, Section 4, Taipei, Taiwan, Republic of China.
Pages 33-41 | Received 10 Jun 1996, Accepted 23 Aug 1996, Published online: 03 Apr 2007

Citations (91)

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 (19)

Joost Berkhout, Eric Pauwels, Rob van der Mei, Jan Stolze & Siem Broersen. (2021) Short-term production scheduling with non-triangular sequence-dependent setup times and shifting production bottlenecks. International Journal of Production Research 59:3, pages 727-751.
Read now
Leilei Meng, Chaoyong Zhang, Xinyu Shao, Biao Zhang, Yaping Ren & Wenwen Lin. (2020) More MILP models for hybrid flow shop scheduling problem and its extended problems. International Journal of Production Research 58:13, pages 3905-3930.
Read now
Leilei Meng, Chaoyong Zhang, Xinyu Shao, Yaping Ren & Caile Ren. (2019) Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines. International Journal of Production Research 57:4, pages 1119-1145.
Read now
Shi Qiang Liu & Erhan Kozan. (2019) Integration of mathematical models for ore mining industry. International Journal of Systems Science: Operations & Logistics 6:1, pages 55-68.
Read now
Liangliang Jin, Qiuhua Tang, Chaoyong Zhang, Xinyu Shao & Guangdong Tian. (2016) More MILP models for integrated process planning and scheduling. International Journal of Production Research 54:14, pages 4387-4402.
Read now
B. Naderi, Majid Khalili & Alireza Arshadi Khamseh. (2014) Mathematical models and a hunting search algorithm for the no-wait flowshop scheduling with parallel machines. International Journal of Production Research 52:9, pages 2667-2681.
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
Marta Castilho Gomes, Ana Paula Barbosa-Póvoa & Augusto Queiroz Novais. (2013) Reactive scheduling in a make-to-order flexible job shop with re-entrant process and assembly: a mathematical programming approach. International Journal of Production Research 51:17, pages 5120-5141.
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
B. Naderi, M. Aminnayeri, M. Piri & M.H. Ha'iri Yazdi. (2012) Multi-objective no-wait flowshop scheduling problems: models and algorithms. International Journal of Production Research 50:10, pages 2592-2608.
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
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
Jen-Shiang Chen & Jason Chao-Hsien Pan. (2006) Integer programming models for the re-entrant shop scheduling problems. Engineering Optimization 38:5, pages 577-592.
Read now
Jen-Shiang Chen. (2006) Using integer programming to solve the machine scheduling problem with a flexible maintenance activity. Journal of Statistics and Management Systems 9:1, pages 87-104.
Read now
Jen-Shiang Chen. (2006) Optimization models for the machine scheduling problem with a single flexible maintenance activity. Engineering Optimization 38:1, pages 53-71.
Read now
Jen-Shiang Chen & Jin-Shan Yang. (2006) Model formulations for the machine scheduling problem with limited waiting time constraints. Journal of Information and Optimization Sciences 27:1, pages 225-240.
Read now
M.C. Gomes , A.P. Barbosa-Póvoa & A.Q. Novais. (2005) Optimal scheduling for flexible job shop operation. International Journal of Production Research 43:11, pages 2323-2353.
Read now
E F Stafford$suffix/text()$suffix/text(), F T Tseng & J N D Gupta. (2005) Comparative evaluation of MILP flowshop models. Journal of the Operational Research Society 56:1, pages 88-101.
Read now
JC-H Pan & J-S Chen. (2003) Minimizing makespan in re-entrant permutation flow-shops. Journal of the Operational Research Society 54:6, pages 642-653.
Read now

Articles from other publishers (72)

Eiji Morinaga, Xuetian Tang, Koji Iwamura & Naoki Hirabayashi. (2024) Improvement of job shop scheduling method based on mathematical optimization and machine learning. Procedia Computer Science 232, pages 871-879.
Crossref
Majid Esmaelian, Milad Mohammadi & Hadi Shahmoradi. (2023) New formulation for scheduling flexible flow shop problems. International Journal on Interactive Design and Manufacturing (IJIDeM) 17:6, pages 3305-3319.
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
Helio Yochihiro Fuchigami & Bruno de Athayde Prata. (2023) Coronavirus Optimization Algorithms for Minimizing Earliness, Tardiness, and Anticipation of Due Dates in Permutation Flow Shop Scheduling. Arabian Journal for Science and Engineering 48:11, pages 15713-15745.
Crossref
Niels Grüuttemeier, Kaja Balzereit, Nehal Soni & Andreas Bunte. (2023) Efficient Production Scheduling by Exploiting Repetitive Product Configurations. Efficient Production Scheduling by Exploiting Repetitive Product Configurations.
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
Mohamed Sayed Al-Ashhab, Abdulrahman Fayez Alhejaili & Shadi M. Munshi. (2023) Developing a multi-objective flexible job shop scheduling optimization model using Lexicographic procedure considering transportation time. Journal of Umm Al-Qura University for Engineering and Architecture 14:1, pages 57-70.
Crossref
Eiji MORINAGA, Kenta TERAMOTOHidefumi WAKAMATSU. (2023) Method of job shop scheduling considering reworking and reprocessing based on proactive approach. Journal of Advanced Mechanical Design, Systems, and Manufacturing 17:1, pages JAMDSM0013-JAMDSM0013.
Crossref
Eiji Morinaga, Xuetian Tang, Koji Iwamura & Naoki Hirabayashi. (2023) An improved method of job shop scheduling using machine learning and mathematical optimization. Procedia Computer Science 217, pages 1479-1486.
Crossref
Eiji Morinaga, Kenta Teramoto & Hidefumi Wakamatsu. 2023. Advances in Production Management Systems. Production Management Systems for Responsible Manufacturing, Service, and Logistics Futures. Advances in Production Management Systems. Production Management Systems for Responsible Manufacturing, Service, and Logistics Futures 576 590 .
Jia He Sun & Salimur Choudhury. 2023. Computational Science – ICCS 2023. Computational Science – ICCS 2023 528 535 .
Huali Fan & Rong Su. (2022) Mathematical Modelling and Heuristic Approaches to Job-shop Scheduling Problem with Conveyor-based Continuous Flow Transporters. Computers & Operations Research 148, pages 105998.
Crossref
Leilei Meng, Biao Zhang, Yaping Ren, Hongyan Sang, Kaizhou Gao & Chaoyong Zhang. (2022) Mathematical Formulations for Asynchronous Parallel Disassembly Planning of End-of-Life Products. Mathematics 10:20, pages 3854.
Crossref
Artur Brum, Rubén Ruiz & Marcus Ritt. (2022) Automatic generation of iterated greedy algorithms for the non-permutation flow shop scheduling problem with total completion time minimization. Computers & Industrial Engineering 163, pages 107843.
Crossref
Eduardo Guzman, Beatriz Andres & Raul Poler. (2021) Matheuristic Algorithm for Job-Shop Scheduling Problem Using a Disjunctive Mathematical Model. Computers 11:1, pages 1.
Crossref
Teeradech Laisupannawong, Boonyarit Intiyot & Chawalit Jeenanunta. (2021) Improved Mixed-Integer Linear Programming Model for Short-Term Scheduling of the Pressing Process in Multi-Layer Printed Circuit Board Manufacturing. Mathematics 9:21, pages 2653.
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
Qihao Liu, Xinyu Li & Liang Gao. (2021) A Novel MILP Model Based on the Topology of a Network Graph for Process Planning in an Intelligent Manufacturing System. Engineering 7:6, pages 807-817.
Crossref
Teeradech Laisupannawong, Boonyarit Intiyot & Chawalit Jeenanunta. (2021) Mixed-Integer Linear Programming Model and Heuristic for Short-Term Scheduling of Pressing Process in Multi-Layer Printed Circuit Board Manufacturing. Mathematics 9:6, pages 653.
Crossref
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
Farzad Sotoudeh, Micah Nehring, Mehmet Kizil, Peter Knights & Amin Mousavi. (2020) Production scheduling optimisation for sublevel stoping mines using mathematical programming: A review of literature and future directions. Resources Policy 68, pages 101809.
Crossref
Natalia P. Basán, Mariana E. Cóccola, Alejandro García del Valle & Carlos A. Méndez. (2020) Scheduling of flexible manufacturing plants with redesign options: A MILP-based decomposition algorithm and case studies. Computers & Chemical Engineering 136, pages 106777.
Crossref
Peter Burggräf, Matthias Dannapfel, Tobias Adlon, Esben Schukat, Hannes Kahmann & Lucian Holtwiesche. (2020) Modeling and evaluating agile assembly systems using mixed-integer linear programming. Procedia CIRP 93, pages 1073-1078.
Crossref
Leilei Meng, Chaoyong Zhang, Xinyu Shao & Yaping Ren. (2019) MILP models for energy-aware flexible job shop scheduling problem. Journal of Cleaner Production 210, pages 710-723.
Crossref
Leilei Meng, Chaoyong Zhang, Biao Zhang & Yaping Ren. (2019) Mathematical Modeling and Optimization of Energy-Conscious Flexible Job Shop Scheduling Problem With Worker Flexibility. IEEE Access 7, pages 68043-68059.
Crossref
Bahman Naderia & Sheida Goharib. (2019) The cycle shop scheduling: mathematical model, properties and solution algorithms. RAIRO - Operations Research 53:1, pages 111-128.
Crossref
Julia Lange & Frank Werner. (2017) Approaches to modeling train scheduling problems as job-shop problems with blocking constraints. Journal of Scheduling 21:2, pages 191-207.
Crossref
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
Shih-Wei Lin, Chung-Cheng Lu & Kuo-Ching Ying. (2018) Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop. IEEE Access 6, pages 78666-78677.
Crossref
Neeraj Gupta, Mahdi Khosravy, Nilesh Patel & Tomonobu Senjyu. (2018) A Bi-Level Evolutionary Optimization for Coordinated Transmission Expansion Planning. IEEE Access 6, pages 48455-48477.
Crossref
Yan Zhao, Liping Chen, Gang Xie, Jianjun Zhao & Jianwan Ding. (2016) GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs. Journal of Combinatorial Optimization 35:1, pages 293-317.
Crossref
Oliver Hinder & Andrew J. Mason. (2017) A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness. European Journal of Operational Research 262:2, pages 411-423.
Crossref
Mohammad Dehghanimohammadabadi, Thomas K. Keyser & S. Hossein Cheraghi. (2017) A novel Iterative Optimization-based Simulation (IOS) framework: An effective tool to optimize system’s performance. Computers & Industrial Engineering 111, pages 1-17.
Crossref
Hamed Samarghandi & Mehdi Behroozi. (2017) On the exact solution of the no-wait flow shop problem with due date constraints. Computers & Operations Research 81, pages 141-159.
Crossref
Fatima El Khoukhi, Jaouad Boukachour & Ahmed El Hilali Alaoui. (2017) The “Dual-Ants Colony”: A novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance. Computers & Industrial Engineering 106, pages 236-255.
Crossref
Eiji MORINAGA, Tomomi NAKAMURA, Hidefumi WAKAMATSU & Eiji ARAI. (2017) Flexible Job-Shop Scheduling Method for Highly-Distributed Manufacturing Systems. Journal of Smart Processing 6:5, pages 181-187.
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 .
Florian Jaehn & Steffen Michaelis. (2016) Shunting of trains in succeeding yards. Computers & Industrial Engineering 102, pages 1-9.
Crossref
Wen-Yang Ku & J. Christopher Beck. (2016) Mixed Integer Programming models for job shop scheduling: A computational analysis. Computers & Operations Research 73, pages 165-173.
Crossref
Zhaoxia GuoZhaoxia Guo. 2016. Intelligent Decision-making Models for Production and Retail Operations. Intelligent Decision-making Models for Production and Retail Operations 1 18 .
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
Bahman Naderi & Ahmed Azab. (2015) An improved model and novel simulated annealing for distributed job shop problems. The International Journal of Advanced Manufacturing Technology 81:1-4, pages 693-703.
Crossref
Majid Khalili & Bahman Naderi. (2014) A bi-objective imperialist competitive algorithm for no-wait flexible flow lines with sequence dependent setup times. The International Journal of Advanced Manufacturing Technology 76:1-4, pages 461-469.
Crossref
Olfa Chebbi & Jouhaina Chaouachi. 2015. Computer Information Systems and Industrial Management. Computer Information Systems and Industrial Management 327 338 .
B. Naderi & A. Azab. (2014) Modeling and heuristics for scheduling of distributed job shops. Expert Systems with Applications 41:17, pages 7754-7763.
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
B. Naderi & M. Yazdani. (2014) A model and imperialist competitive algorithm for hybrid flow shops with sublots and setup times. Journal of Manufacturing Systems 33:4, pages 647-653.
Crossref
Ezzeddine Fatnassi, Olfa Chebbi & Jouhaina Chaouachi Siala. (2014) Comparison of two mathematical formulations for the offline routing of personal rapid transit system vehicles. Comparison of two mathematical formulations for the offline routing of personal rapid transit system vehicles.
Yunfei Chu & Fengqi You. (2014) Integrated Scheduling and Dynamic Optimization by Stackelberg Game: Bilevel Model Formulation and Efficient Solution Algorithm. Industrial & Engineering Chemistry Research 53:13, pages 5564-5581.
Crossref
Majid Khalili. (2013) A multi-objective electromagnetism algorithm for a bi-objective hybrid no-wait flowshop scheduling problem. The International Journal of Advanced Manufacturing Technology 70:9-12, pages 1591-1601.
Crossref
Yunfei Chu, Fengqi You & John M. Wassick. (2014) Hybrid method integrating agent-based modeling and heuristic tree search for scheduling of complex batch processes. Computers & Chemical Engineering 60, pages 277-296.
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
Yunfei Chu & Fengqi You. (2013) Integration of Scheduling and Dynamic Optimization of Batch Processes under Uncertainty: Two-Stage Stochastic Programming Approach and Enhanced Generalized Benders Decomposition Algorithm. Industrial & Engineering Chemistry Research 52:47, pages 16851-16869.
Crossref
Yunus Demir & S. Kürşat İşleyen. (2013) Evaluation of mathematical models for flexible job-shop scheduling problems. Applied Mathematical Modelling 37:3, pages 977-988.
Crossref
Junqing Li, Quanke Pan & Shengxian Xie. (2012) An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems. Applied Mathematics and Computation 218:18, pages 9353-9371.
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, 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.
M. Jenabi, B. Naderi & S.M.T. Fatemi Ghomi. (2010) A bi-objective case of no-wait flowshops. A bi-objective case of no-wait flowshops.
Cemal Özgüven, Lale Özbakır & Yasemin Yavuz. (2010) Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Applied Mathematical Modelling 34:6, pages 1539-1548.
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
Andreas Klemmt, Sven Horn, Gerald Weigert & Klaus-Jürgen Wolter. (2009) Simulation-based optimization vs. mathematical programming: A hybrid approach for optimizing scheduling problems. Robotics and Computer-Integrated Manufacturing 25:6, pages 917-925.
Crossref
Roland Braune, Gunther Zapfel & Michael Affenzeller. (2009) A Computational Study of Lower Bounding Schemes for Total Weighted Tardiness Job Shops. A Computational Study of Lower Bounding Schemes for Total Weighted Tardiness Job Shops.
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.
Jason Chao-Hsien Pan & Jen-Shiang Chen. (2005) Mixed binary integer programming formulations for the reentrant job shop scheduling problem. Computers & Operations Research 32:5, pages 1197-1212.
Crossref
Fan T Tseng, Edward F StaffordJr.Jr. & Jatinder N.D Gupta. (2004) An empirical analysis of integer programming formulations for the permutation flowshop. Omega 32:4, pages 285-293.
Crossref
John Hooker. 2000. Logic‐Based Methods for Optimization. Logic‐Based Methods for Optimization 463 481 .
M.F. Hussain & S.B. Joshi. (1998) A genetic algorithm for job shop scheduling problems with alternate routing. A genetic algorithm for job shop scheduling problems with alternate routing.
Oliver Avalos-Rosales & Yajaira Cardona-Valdés. (2022) Binary Variable Relaxation in MIP Formulations. SSRN Electronic Journal.
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.