A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates

DOI10.1007/s10479-010-0746-6zbMath1209.90192MaRDI QIDQ2430605

Kailiang Xu, Liangjun Ke, Zu-Ren Feng

Publication date: 8 April 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0746-6

zbMATH Keywords

scheduling; single machine; controllable processing times; convex resource consumption function

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Throughput optimization for the Robotic Cell Problem with Controllable Processing Times, Single machine scheduling with total tardiness criterion and convex controllable processing times, A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates, Scheduling problems with position dependent job processing times: computational complexity results, Inverse interval scheduling via reduction on a single machine, Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production

Cites Work

• Unnamed Item
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
• A note on minimizing maximum lateness in a one-machine sequencing problem with release dates
• The one-machine sequencing problem
• Single machine scheduling problem with a common deadline and resource dependent release dates
• Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
• Multiple-machine scheduling with earliness, tardiness and completion time penalties
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• 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
• Parallel machine scheduling with a convex resource consumption function
• A Search Procedure for Hamilton Paths and Circuits
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
• 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