Machine scheduling with an availability constraint
From MaRDI portal
Publication:2564885
DOI10.1007/BF00121681zbMath0870.90071MaRDI QIDQ2564885
Publication date: 7 January 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
heuristics; error bound; performance measures; machine breakdown; availability constraint; pseudo-polynomial dynamic programming
Related Items
Unnamed Item, Scheduling jobs in open shops with limited machine availability, A note on single-machine makespan scheduling with deteriorating jobs and scheduled maintenance, Integrated production planning and preventive maintenance in deteriorating production systems, Single-machine scheduling with maintenance and repair rate-modifying activities, Scheduling with tool changes to minimize total completion time: Basic results and SPT performance, Approximability of single machine scheduling with fixed jobs to minimize total completion time, Single-machine scheduling with periodic maintenance to minimize makespan, Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints, An integrated production and preventive maintenance planning model, Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan, Approximation results for flow shop scheduling problems with machine availability constraints, Job scheduling and management of wearing tools with stochastic tool lifetimes, Makespan minimization for two parallel machines scheduling with a periodic availability constraint, Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine, A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan, Two-machine flowshop scheduling with availability constraints, 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., Machine scheduling with a rate-modifying activity, Heuristics for two-machine no-wait flowshop scheduling with an availability constraint, Preemptive scheduling with availability constraints to minimize total weighted completion times, Match-up scheduling under a machine breakdown, Single-machine scheduling with periodic maintenance and nonresumable jobs., Makespan minimization for two parallel machines with an availability constraint, Parallel machine scheduling with machine availability and eligibility constraints, Single machine unbounded parallel-batch scheduling with forbidden intervals, Parallel-machine scheduling under potential disruption, Multi-machine scheduling with deteriorating jobs and scheduled maintenance, Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan, Scheduling linear deteriorating jobs with an availability constraint on a single machine, Machine scheduling performance with maintenance and failure, SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel machines scheduling with nonsimultaneous machine available time
- Single machine flow-time scheduling with a single breakdown
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Minimizing the sum of job completion times on capacitated parallel machines
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- A Review of Production Scheduling
- The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
- Approximate Algorithms for the 0/1 Knapsack Problem
