Flow shops with machine maintenance: ordered and proportionate cases
From MaRDI portal
Recommendations
- A note on the proportionate flow shop with a bottleneck machine
- Two-machine flow shop with synchronized periodic maintenance
- Scheduling a proportionate flow shop of batching machines
- Scheduling a proportionate flow shop of batching machines
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- Flow-shops with a dominant machine
- Two-machine flow shop no-wait scheduling with machine maintenance
- Considering scheduling and preventive maintenance in the flowshop sequencing problem
- Flow shop scheduling problems under machine-dependent precedence constraints
- Two-machine flow shops with limited machine availability
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- A note on the complexity of flow shop scheduling with transportation constraints
- A note on the proportionate flow shop with a bottleneck machine
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Approximation results for flow shop scheduling problems with machine availability constraints
- Batching and scheduling in a multi-machine flow shop
- Cooperative metaheuristics for the permutation flowshop scheduling problem
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Flowshop sequencing problem with ordered processing time matrices: A general case
- Flowshop-scheduling problems with makespan criterion: a review
- Focused Scheduling in Proportionate Flowshops
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
- Minimizing total completion time in a two-machine flowshop: Analysis of special cases
- Minimizing total weighted completion time in a proportionate flow shop
- Optimal two- and three-stage production schedules with set-up time included
- Ordered Flow Shop Problems with no In-Process Waiting: Further Results
- The Complexity of Flowshop and Jobshop Scheduling
- The three-machine proportionate flow shop problem with unequal machine speeds
- Two-machine flow shops with limited machine availability
- Two-machine flowshop scheduling with availability constraints
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
Cited in
(9)- Online scheduling of ordered flow shops
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Flow-shops with a dominant machine
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- Single machine flow-time scheduling with scheduled maintenance
- Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration
- Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
- Three-stage assembly flow shop scheduling problem with a fixed maintenance period
This page was built for publication: Flow shops with machine maintenance: ordered and proportionate cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992582)
