Two-machine flow shops with limited machine availability
From MaRDI portal
(Redirected from Publication:5953341)
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
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1128827 (Why is no real title available?)
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Optimal two- and three-stage production schedules with set-up time included
- Parallel machines scheduling with nonsimultaneous machine available time
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- Scheduling on semi-identical processors
Cited in
(42)- Exponential inapproximability and FPTAS for scheduling with availability constraints
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- Flow-shops with a dominant machine
- 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.
- Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability
- A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach
- Approximation results for the two-machine job shop under limited machine availability
- Scheduling with limited machine availability
- A PTAS for non-resumable open shop scheduling with an availability constraint
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- Scheduling jobs and maintenance activities on parallel machines
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- A market-based multi-agent system model for decentralized multi-project scheduling
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- Scheduling two-stage hybrid flow shop with availability constraints
- Two-machine flow shop scheduling integrated with preventive maintenance planning
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
- Two-Machine Open Shops with Renewable Resources
- Stability of Johnson's schedule with respect to limited machine availability
- Scheduling jobs in open shops with limited machine availability
- The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
- A PTAS for a particular case of the two-machine flow shop with limited machine availability
- Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
- Two-machine flow shop with synchronized periodic maintenance
- Optimality of Jackson's permutations with respect to limited machine availability
- scientific article; zbMATH DE number 2230238 (Why is no real title available?)
- Integrated production planning and preventive maintenance in deteriorating production systems
- Two-machine open shop scheduling with an availability constraint
- An improved algorithm for the two machine flow shop problem with several availability constraints
- Three-stage assembly flow shop scheduling problem with a fixed maintenance period
- A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- A new approach for scheduling independent tasks with multiple modes
- An integrated production and preventive maintenance planning model
- Approximation results for flow shop scheduling problems with machine availability constraints
- Flow shops with machine maintenance: ordered and proportionate cases
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)
