A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
From MaRDI portal
Publication:976008
DOI10.1016/j.cor.2009.11.012zbMath1188.90088OpenAlexW2069348829MaRDI QIDQ976008
Kailiang Xu, Keliang Jun, Zu-Ren Feng
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.11.012
Related Items (6)
Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness ⋮ Optimization of scheduling problems with deterioration effects and an optional maintenance activity ⋮ Throughput optimization for the Robotic Cell Problem with Controllable Processing Times ⋮ Single machine scheduling with total tardiness criterion and convex controllable processing times
Cites Work
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- 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
- A tabu search algorithm for parallel machine total tardiness problem
- 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
- Applying tabu search to the job-shop scheduling problem
- A survey of scheduling with controllable processing times
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
- Parallel machine scheduling with a convex resource consumption function
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- 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
- Unnamed Item
- Unnamed Item
This page was built for publication: A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
