Two-machine flow shops with limited machine availability
From MaRDI portal
Publication:5953341
DOI10.1016/S0377-2217(01)00083-2zbMATH Open1007.90026OpenAlexW2065819816WikidataQ57387831 ScholiaQ57387831MaRDI QIDQ5953341FDOQ5953341
Authors: Wieslaw Kubiak, Jacek Blazewicz, Piotr Formanowicz, Joachim Breit, Günter Schmidt 
Publication date: 23 January 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00083-2
Recommendations
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Two-machine flow shop problems with availability constraints
- Two-machine flowshop scheduling with availability constraints
Cites Work
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- Title not available (Why is that?)
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Scheduling on semi-identical processors
- Parallel machines scheduling with nonsimultaneous machine available time
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
Cited In (40)
- A market-based multi-agent system model for decentralized multi-project scheduling
- Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
- Scheduling jobs and maintenance activities on parallel machines
- Scheduling two-stage hybrid flow shop with availability constraints
- A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- An improved algorithm for the two machine flow shop problem with several availability constraints
- Two-machine flow shop with synchronized periodic maintenance
- Exponential inapproximability and FPTAS for scheduling with availability constraints
- A new approach for scheduling independent tasks with multiple modes
- Flow-shops with a dominant machine
- A PTAS for non-resumable open shop scheduling with an availability constraint
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- Two-machine open shop scheduling with an availability constraint
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
- Scheduling jobs in open shops with limited machine availability
- Title not available (Why is that?)
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- Flow shops with machine maintenance: ordered and proportionate cases
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Integrated production planning and preventive maintenance in deteriorating production systems
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- Scheduling with limited machine availability
- Approximation results for the two-machine job shop under limited machine availability
- Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
- Two-machine flow shop scheduling integrated with preventive maintenance planning
- Optimality of Jackson's permutations with respect to limited machine availability
- An integrated production and preventive maintenance planning model
- A mixed integer linear programming approach to minimize the number of late jobs with and without 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
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
- Two-Machine Open Shops with Renewable Resources
- 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
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Stability of Johnson's schedule with respect to limited machine availability
- Three-stage assembly flow shop scheduling problem with a fixed maintenance period
This page was built for publication: Two-machine flow shops with limited machine availability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953341)
