A heuristic for maximizing the number of on-time jobs on two uniform parallel machines

DOI10.1002/NAV.20161zbMATH Open1106.90033OpenAlexW2038586658MaRDI QIDQ3423282FDOQ3423282

Authors: George J. Kyparisis, C. Koulamas 

Publication date: 20 February 2007

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20161

Recommendations

• Makespan minimization on uniform parallel machines with release times
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• Heuristics for parallel machine scheduling with delivery times
• A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
• Scheduling on uniform nonsimultaneous parallel machines

zbMATH Keywords

approximation algorithmsdue datesschedulingworst-case boundsuniform parallel machines

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cited In (5)

• A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
• Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
• A note on the maximum number of on-time jobs on parallel identical machines.
• A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
• Makespan minimization on uniform parallel machines with release times

This page was built for publication: A heuristic for maximizing the number of on-time jobs on two uniform parallel machines

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