Minimizing the makespan in nonpreemptive parallel machine scheduling problem
From MaRDI portal
Publication:655176
DOI10.1007/S10852-009-9120-6zbMATH Open1229.68083OpenAlexW1981927125MaRDI QIDQ655176FDOQ655176
Authors: G. Chiaselotti, Maria Italia Gualtieri, Paolamaria Pietramala 
Publication date: 2 January 2012
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-009-9120-6
Recommendations
- Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions
- A note on the optimal makespan of a parallel machine scheduling problem
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
- Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
- Minimizing makespan in parallel flowshops
- Makespan minimization subject to flowtime optimality on identical parallel machines
Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- A state-of-the-art review of parallel-machine scheduling research
- Title not available (Why is that?)
- An Application of Bin-Packing to Multiprocessor Scheduling
- On the exact upper bound for the Multifit processor scheduling algorithm
- Title not available (Why is that?)
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors
- Title not available (Why is that?)
Cited In (22)
- A note on the optimal makespan of a parallel machine scheduling problem
- A new polynomial algorithm for a parallel identical scheduling problem
- A new \(n \log n\) algorithm for the identical parallel machine scheduling problem
- Partial solutions and multifit algorithm for multiprocessor scheduling
- Linear time algorithms for parallel machine scheduling
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Improved approaches to the exact solution of the machine covering problem
- On the Minimization of the Makespan Subject to Flowtime Optimality
- Minimizing makespan in parallel flowshops
- Heuristic algorithms for scheduling jobs on identical parallel machines via measures of spread
- Scheduling parallel jobs to minimize the makespan
- Makespan minimization for parallel machines environment with machine dependent processing time by using PBIL combined with local search
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
- Title not available (Why is that?)
- Discrete parallel machine makespan ScheLoc problem
- Worst-case ratio of \(A_{kk}\) algorithm for problem \(P_m,a_i\|C_{\max}\)
- A short note on an advance in estimating the worst-case performance ratio of the MPS algorithm
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors
- Title not available (Why is that?)
This page was built for publication: Minimizing the makespan in nonpreemptive parallel machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655176)
