Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
From MaRDI portal
(Redirected from Publication:1362517)
Recommendations
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Machine scheduling with an availability constraint
- Minimizing makespan in hybrid flowshops
- 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
- 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
(61)- Job scheduling and management of wearing tools with stochastic tool lifetimes
- Scheduling jobs and maintenance activities on parallel machines
- Scheduling two-stage hybrid flow shop with availability constraints
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- Makespan Minimization with Machine Availability Constraints
- An improved algorithm for the two machine flow shop problem with several availability constraints
- Two-machine flowshop scheduling in a physical examination center
- Two-machine flow shop with synchronized periodic maintenance
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- A PTAS for non-resumable open shop scheduling with an availability constraint
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- On-line and semi-online scheduling for flow shop problems on two machines
- Two-machine flowshop scheduling with consecutive availability constraints
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- scientific article; zbMATH DE number 5732726 (Why is no real title available?)
- Algorithms for minimizing the makespan in a two-machine cross-docking flow shop problem
- Two-machine open shop scheduling with an availability constraint
- Scheduling jobs in open shops with limited machine availability
- New single machine and job-shop scheduling problems with availability constraints
- Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods
- Flow shops with machine maintenance: ordered and proportionate cases
- Two-agent scheduling in a flowshop
- Integrated production planning and preventive maintenance in deteriorating production systems
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
- scientific article; zbMATH DE number 1389747 (Why is no real title available?)
- Scheduling with limited machine availability
- An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
- Approximation results for the two-machine job shop under limited machine availability
- A new tabu search procedure for an audit-scheduling problem
- Two-machine flow shop scheduling integrated with preventive maintenance planning
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
- An integrated production and preventive maintenance planning model
- Optimality of Jackson's permutations with respect to limited machine availability
- 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
- Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
- Two-machine flow shops with limited machine availability
- Single-machine scheduling with maintenance and repair rate-modifying activities
- A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
- Two-machine flowshop scheduling with availability constraints
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- Approximation results for flow shop scheduling problems with machine availability constraints
- An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Two-machine flow shop scheduling problems with no-wait jobs
- Machine scheduling with a rate-modifying activity
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
- Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown
- Stability of Johnson's schedule with respect to limited machine availability
- Two-machine flow shop problems with availability constraints
- Match-up scheduling under a machine breakdown
- Three-stage assembly flow shop scheduling problem with a fixed maintenance period
- A two-machine flowshop scheduling problem with a separated maintenance constraint
This page was built for publication: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362517)
