Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine

DOI10.1007/s10951-012-0290-0zbMath1280.90075OpenAlexW2023280858MaRDI QIDQ2434305

Liron Yedidsion

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-012-0290-0

zbMATH Keywords

makespansingle machine schedulingmaximum latenessmulti-objectivebi-criteriaconvex resource allocationtri-criteria

Mathematics Subject Classification ID

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

Cites Work

• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
• A bicriterion approach to time/cost trade-offs in sequencing
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Single machine scheduling with a variable common due date and resource-dependent processing times.
• Some comments on sequencing with controllable processing times
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• Minimizing the total weighted flow time in a single machine with controllable processing times
• A survey of scheduling with controllable processing times
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases