Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness

DOI10.1007/s10878-015-9918-2zbMath1350.90019OpenAlexW745945136MaRDI QIDQ306084

Jinjiang Yuan, Qijia Liu

Publication date: 31 August 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9918-2

zbMATH Keywords

online algorithmscompetitive ratiosingle machine schedulingbicriteria optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Online scheduling on bounded batch machines to minimize the maximum weighted completion time ⋮ Large-scale medical examination scheduling technology based on intelligent optimization

Cites Work

• Unnamed Item
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Pareto approximations for the bicriteria scheduling problem
• Multicriteria scheduling
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine

This page was built for publication: Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness