Maximizing the minimum completion time on parallel machines

DOI10.1007/S10288-007-0053-5zbMath1165.90457OpenAlexW2011571669MaRDI QIDQ1029565

Mahdi Jemmali, Mohamed Haouari

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)

Related Items (6)

Comparing the minimum completion times of two longest-first scheduling-heuristics ⋮ A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines ⋮ Improved approaches to the exact solution of the machine covering problem ⋮ Lower bounds and algorithms for the minimum cardinality bin covering problem ⋮ Dispatching-rule variants algorithms for used spaces of storage supports ⋮ A new approach for bicriteria partitioning problem

Cites Work

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

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