A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

DOI10.1007/s10951-007-0044-6zbMath1153.90442OpenAlexW2129215899MaRDI QIDQ954246

Liron Yedidsion, Dvir Shabtay, Moshe Kaspi

Publication date: 10 November 2008

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

Full work available at URL: https://doi.org/10.1007/s10951-007-0044-6

zbMATH Keywords

single machine schedulingbicriteriaconvex resource allocationmaximal lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

A survey of scheduling with controllable processing times ⋮ Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times ⋮ Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness ⋮ A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates ⋮ Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine ⋮ Bicriteria robotic cell scheduling with controllable processing times ⋮ Parallel machine match-up scheduling with manufacturing cost considerations ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates ⋮ A unified approach for scheduling with convex resource consumption functions using positional penalties ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Single machine batch scheduling to minimize total completion time and resource consumption costs
• A survey of results for sequencing problems with controllable processing times
• A bicriterion approach to time/cost trade-offs in sequencing
• Single machine scheduling subject to deadlines and resource dependent processing times
• Two parallel machine sequencing problems involving controllable job processing times
• 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
• Single machine batch scheduling with deadlines and resource dependent processing times
• A survey of scheduling with controllable processing times
• Single machine scheduling with controllable release and processing parameters
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• 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

This page was built for publication: A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine