Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
From MaRDI portal
Publication:322736
DOI10.1016/j.ejor.2015.11.020zbMath1346.90346OpenAlexW2184839389MaRDI QIDQ322736
Ridvan Gedik, Chase Rainwater, Heather Nachtmann, Edward A. Pohl
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.11.020
mixed integer programmingconstraint programminglogic-based Benders decompositionscheduling with job availability intervalssequence dependent setup times
Related Items (8)
IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG ⋮ Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints ⋮ Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut ⋮ The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach ⋮ No-wait flowshop scheduling problem with two criteria; total tardiness and makespan ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
Cites Work
- Unnamed Item
- Unnamed Item
- A constraint programming based column generation approach to nurse rostering problems
- A constraint programming-based solution approach for medical resident scheduling problems
- Scheduling jobs with fixed start and end times
- A new approach to integrating mixed integer programming and constraint logic programming
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Logic, Optimization, and Constraint Programming
- A GRASP for Parallel Machine Scheduling with Time Windows
- Benders' cuts guided large neighborhood search for the traveling umpire problem
- Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
- Working time constraints in operational fixed job scheduling
- A fixed job scheduling problem with machine-dependent job weights
- Planning and Scheduling by Logic-Based Benders Decomposition
- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- The wafer probing scheduling problem (WPSP)
- Mathematical programming techniques in constraint programming: a short overview
- A constraint-based method for project scheduling with time windows
This page was built for publication: Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
