Mixed integer programming models for job shop scheduling: A computational analysis

DOI10.1016/j.cor.2016.04.006zbMath1349.90365OpenAlexW2518264398MaRDI QIDQ342439

Wen-Yang Ku, J. Christopher Beck

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1807/72022

zbMATH Keywords

job shop schedulingmixed integer programmingconstraint programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (15)

IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG ⋮ Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms ⋮ A survey of job shop scheduling problem: the types and models ⋮ Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem ⋮ A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ Optimizing the workload of production units of a make-to-order manufacturing system ⋮ Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters ⋮ An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs ⋮ An improved decision support model for scheduling production in an engineer-to-order manufacturer ⋮ Quantum annealing to solve the unrelated parallel machine scheduling problem ⋮ Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut ⋮ A new heuristic and an exact approach for a production planning problem ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ Combining constraint programming and temporal decomposition approaches -- scheduling of an industrial formulation plant

Uses Software

• SCIP
• MIPLIB
• CPLEX
• Gurobi
• Benchmarks for Optimization Software
• JOBSHOP

Cites Work

• Unnamed Item
• Unnamed Item
• SCIP: solving constraint integer programs
• A genetic algorithm for the job shop problem
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Benchmarks for basic scheduling problems
• An advanced tabu search algorithm for the job shop problem
• Conflict analysis in mixed integer programming
• Combining Constraint Programming and Local Search for Job-Shop Scheduling
• Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
• A study of integer programming formulations for scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Improved Formulation for the Job-Shop Scheduling Problem
• A Computational Study of the Job-Shop Scheduling Problem
• The Schedule-Sequencing Problem
• Exploiting Erraticism in Search

This page was built for publication: Mixed integer programming models for job shop scheduling: A computational analysis