Parallel machine scheduling with machine availability and eligibility constraints
From MaRDI portal
Publication:2384614
DOI10.1016/j.ejor.2006.11.027zbMath1168.90458OpenAlexW2033861214MaRDI QIDQ2384614
Publication date: 10 October 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.11.027
Related Items (21)
Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration ⋮ Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions ⋮ Minimizing resource consumption on uniform parallel machines with a bound on makespan ⋮ Scheduling jobs with maintenance subject to load-dependent duration on a single machine ⋮ A new approach based on the learning effect for sequence-dependent parallel machine scheduling problem under uncertainty ⋮ The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach ⋮ Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques ⋮ Approximation schemes for parallel machine scheduling with availability constraints ⋮ Performance guarantees of jump neighborhoods on restricted related parallel machines ⋮ Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach ⋮ Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers ⋮ Approximation algorithms for scheduling with reservations ⋮ Solving an integrated job-shop problem with human resource constraints ⋮ Makespan minimization for parallel machines scheduling with multiple availability constraints ⋮ A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ⋮ MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS ⋮ Exponential inapproximability and FPTAS for scheduling with availability constraints ⋮ Heuristics for online scheduling on identical parallel machines with two GoS levels ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel machines scheduling with nonsimultaneous machine available time
- Machine scheduling with availability constraints
- Nearly on line scheduling of preemptive independent tasks
- Current trends in deterministic scheduling
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Scheduling preemptable tasks on parallel processors with limited availability
- Parallel machines scheduling with machine shutdowns
- A note on parallel machine scheduling with non-simultaneous machine available time
- Scheduling with limited machine availability
- Machine scheduling with an availability constraint
- Scheduling on semi-identical processors
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some simple scheduling algorithms
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
This page was built for publication: Parallel machine scheduling with machine availability and eligibility constraints
