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.012zbMATH Open1188.90088OpenAlexW2069348829MaRDI QIDQ976008FDOQ976008
Kailiang Xu, Keliang Jun, Zuren 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
Recommendations
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Single machine scheduling problem with controllable processing time and setup under convex resource consumption costs
Cites Work
- A survey of scheduling with controllable processing times
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
- Applying tabu search to the job-shop scheduling problem
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- A tabu search algorithm for parallel machine total tardiness problem
- Single machine scheduling problem with a common deadline and resource dependent release dates
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Minimizing the total weighted flow time in a single machine with controllable processing times
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Title not available (Why is that?)
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- 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
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
Cited In (8)
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- Optimization of scheduling problems with deterioration effects and an optional maintenance activity
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
- Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
- Throughput optimization for the Robotic Cell Problem with Controllable Processing Times
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976008)
