Two-machine flowshop scheduling with availability constraints
From MaRDI portal
Recommendations
- Two-machine flowshop scheduling with consecutive availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Two-machine flow shop problems with availability constraints
- Approximation results for flow shop scheduling problems with machine availability constraints
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Current trends in deterministic scheduling
- Machine scheduling with an availability constraint
- Minimizing makespan in hybrid flowshops
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Minimizing the sum of job completion times on capacitated parallel machines
- Optimal two- and three-stage production schedules with set-up time included
- Parallel machines scheduling with nonsimultaneous machine available time
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- Scheduling on semi-identical processors
- Single machine flow-time scheduling with a single breakdown
- Single machine flow-time scheduling with scheduled maintenance
- The Complexity of Flowshop and Jobshop Scheduling
- The Lessons of Flowshop Scheduling Research
Cited in
(57)- Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown
- Three-stage assembly flow shop scheduling problem with a fixed maintenance period
- Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
- Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach
- Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- New single machine and job-shop scheduling problems with availability constraints
- A PTAS for non-resumable open shop scheduling with an availability constraint
- A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach
- Two-machine flowshop scheduling with consecutive availability constraints
- Approximation results for flow shop scheduling problems with machine availability constraints
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Two-machine flow shops with limited machine availability
- Two-machine open shop scheduling with an availability constraint
- Open shop scheduling problem with a non-resumable flexible maintenance period
- A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
- Single-machine scheduling with maintenance and repair rate-modifying activities
- Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines
- A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
- Flow shops with machine maintenance: ordered and proportionate cases
- An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- Scheduling two-stage hybrid flow shop with availability constraints
- Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures
- A two-stage flow shop scheduling with a critical machine and batch availability
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time
- An improved algorithm for the two machine flow shop problem with several availability constraints
- Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
- Makespan minimization for two parallel machines with an availability constraint
- Scheduling two agents with controllable processing times
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
- Scheduling a maintenance activity to minimize total weighted completion-time
- Scheduling jobs in open shops with limited machine availability
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- Dynamic programming for delayed product differentiation.
- Two-machine flow shop problems with availability constraints
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- Two-agent scheduling in a flowshop
- Online and semi-online scheduling to minimize makespan on single machine with an availability constraint
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Single machine scheduling with forbidden start times
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
- A PTAS for a particular case of the two-machine flow shop with limited machine availability
- The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
- Approximation results for the two-machine job shop under limited machine availability
- Single machine scheduling with semi-resumable machine availability constraints
- scientific article; zbMATH DE number 5732726 (Why is no real title available?)
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
- Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
This page was built for publication: Two-machine flowshop scheduling with availability constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296377)
