Mathematical models for preemptive shop scheduling problems

DOI10.1016/j.cor.2011.09.013zbMath1251.90138OpenAlexW2047619314MaRDI QIDQ1762150

Ghasem Moslehi, Abbas Ebadi

Publication date: 15 November 2012

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

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

zbMATH Keywords

integer linear programmingjob shop scheduling problempreemptionflow shop scheduling problem

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Preemptive job-shop scheduling problems with a fixed number of jobs
• Two models for a family of flowshop sequencing problems
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints
• NP-hardness of shop-scheduling problems with three jobs
• Mixed binary integer programming formulations for the reentrant job shop scheduling problem
• Two MILP models for the N × M SDST flowshop sequencing problem
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• An Improved Formulation for the Job-Shop Scheduling Problem
• Dynamic models of production with multiple operations and general processing times
• The Schedule-Sequencing Problem
• Optimal scheduling for flexible job shop operation
• Scheduling
• Tighter bounds on preemptive job shop scheduling with two machines

This page was built for publication: Mathematical models for preemptive shop scheduling problems