Makespan minimization for parallel machines scheduling with multiple availability constraints
From MaRDI portal
Publication:744645
DOI10.1007/S10479-012-1059-8zbMATH Open1296.90048OpenAlexW2005299742MaRDI QIDQ744645FDOQ744645
Authors: Navid Hashemian, C. Diallo, B. Vizvári 
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1059-8
Recommendations
- Makespan minimization for two parallel machines with an availability constraint
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
- Parallel machine makespan minimization subject to machine availability and total completion time constraints
- Makespan Minimization with Machine Availability Constraints
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
- Optimal parallel machines scheduling with availability constraints
- Minimizing makespan for two parallel machines with job limit on each availability interval
- Makespan minimization on multiple machines subject to machine unavailability and total completion time constraints
- Approximation schemes for parallel machine scheduling with availability constraints
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounds on Multiprocessing Timing Anomalies
- Scheduling with limited machine availability
- Makespan minimization for two parallel machines with an availability constraint
- Current trends in deterministic scheduling
- Scheduling preemptable tasks on parallel processors with limited availability
- Machine scheduling with an availability constraint
- Parallel machine scheduling with machine availability and eligibility constraints
- Title not available (Why is that?)
- Parallel machines scheduling with nonsimultaneous machine available time
- Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
- Title not available (Why is that?)
Cited In (16)
- Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization
- Two parallel machines problem with job delivery coordination and availability constraint
- Makespan Minimization with Machine Availability Constraints
- Multitasking via alternate and shared processing: algorithms and complexity
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Optimal parallel machines scheduling with availability constraints
- Minimizing makespan for two parallel machines with job limit on each availability interval
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
- Makespan minimization for two parallel machines with an availability constraint
- Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
- Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
- Bounds for parallel machine scheduling with predefined parts of jobs and setup time
- A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection
Uses Software
This page was built for publication: Makespan minimization for parallel machines scheduling with multiple availability constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744645)
