New single machine and job-shop scheduling problems with availability constraints
From MaRDI portal
Publication:880500
DOI10.1007/S10951-005-6812-2zbMath1123.90033OpenAlexW2040303793MaRDI QIDQ880500
Ph. Mauguière, Jean-Louis Bouquard, Jean-Charles Billaut
Publication date: 15 May 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-005-6812-2
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization ⋮ Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval ⋮ Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ Single machine unbounded parallel-batch scheduling with forbidden intervals ⋮ Single machine scheduling with small operator-non-availability periods ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ Solving an integrated job-shop problem with human resource constraints ⋮ Single machine scheduling with forbidden start times ⋮ Approximation algorithms for single machine scheduling with one unavailability period
Cites Work
- Unnamed Item
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A block approach for single-machine scheduling with release dates and due dates
- The one-machine sequencing problem
- A branch and bound algorithm for the job-shop scheduling problem
- Adjustment of heads and tails for the job-shop problem
- Job shop scheduling with deadlines
- Multiple-Machine Lower Bounds for Shop-Scheduling Problems
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- On scheduling with ready-times, due-dates and vacations
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Minimizing maximum lateness on one machine: computational experience and some applications
- Job-Shop Scheduling by Implicit Enumeration
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Sequencing with due-dates and early start times to minimize maximum tardiness
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
This page was built for publication: New single machine and job-shop scheduling problems with availability constraints
