Mixed binary integer programming formulations for the reentrant job shop scheduling problem

DOI10.1016/j.cor.2003.10.004zbMath1074.90019OpenAlexW2041592598MaRDI QIDQ2485171

Jason Chao-Hsien Pan, Jen-Shiang Chen

Publication date: 3 August 2005

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

Full work available at URL: https://doi.org/10.1016/j.cor.2003.10.004

zbMATH Keywords

Integer programmingSchedulingReentrant job shops

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (12)

The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ Evaluation of mathematical models for flexible job-shop scheduling problems ⋮ Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling ⋮ Optimization of the integrated problem of employee timetabling and job shop scheduling ⋮ Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Mathematical models for preemptive shop scheduling problems ⋮ A survey on matheuristics for routing problems ⋮ Multi-objective reentrant hybrid flowshop scheduling with machines turning on and off control strategy using improved multi-verse optimizer algorithm ⋮ Minimizing total tardiness on a two-machine re-entrant flowshop ⋮ New multi-objective method to solve reentrant hybrid flow shop scheduling problem

Uses Software

• LINDO
• LINGO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical programming formulations for machine scheduling: A survey
• A study of integer programming formulations for scheduling problems
• An Improved Formulation for the Job-Shop Scheduling Problem
• On general routing problems
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Minimizing Makespan in a Class of Reentrant Shops
• The Schedule-Sequencing Problem
• Algorithms for Solving Production-Scheduling Problems

This page was built for publication: Mixed binary integer programming formulations for the reentrant job shop scheduling problem