Maximizing the minimum completion time on parallel machines

DOI10.1007/S10288-007-0053-5MaRDI QIDQ1029565zbMATH OpenOpenAlexFDO

Authors Mohamed Haouari, Mahdi Jemmali

Publication date 13 July 2009

Published in 4OR (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/22923

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Tight bounds for the identical parallel machine‐scheduling problem: Part II
• Improved approaches to the exact solution of the machine covering problem
• Minimizing makespan on parallel machines subject to release dates and delivery times
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Minimizing the sum of job completion times on capacitated two-parallel machines

Cites work

• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Dynamic programming on the word RAM
• Improving Discrete Model Representations via Symmetry Considerations
• Lower bounds for scheduling on identical parallel machines with heads and tails
• On-line machine covering
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• The exact LPT-bound for maximizing the minimum completion time
• Tight bounds for the identical parallel machine scheduling problem

Cited in

(13)

• Minimizing the sum of job completion times on capacitated parallel machines
• A new approach for bicriteria partitioning problem
• Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
• A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines
• Dispatching-rule variants algorithms for used spaces of storage supports
• Improved approaches to the exact solution of the machine covering problem
• Tight bounds for the identical parallel machine‐scheduling problem: Part II
• Comparing the minimum completion times of two longest-first scheduling-heuristics
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• scientific article; zbMATH DE number 1947447 (Why is no real title available?)
• Lower bounds and algorithms for the minimum cardinality bin covering problem
• Optimizing busy time on parallel machines
• Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine

This page was built for publication: Maximizing the minimum completion time on parallel machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029565)