A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
From MaRDI portal
(Redirected from Publication:976008)
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
- scientific article; zbMATH DE number 3976751 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
- A survey of scheduling with controllable processing times
- A tabu search algorithm for parallel machine total tardiness problem
- Applying tabu search to the job-shop scheduling problem
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a convex resource consumption function
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Single machine scheduling problem with a common deadline and resource dependent release dates
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
Cited in
(9)- Throughput optimization for the robotic cell problem with controllable processing times
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
- 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
- A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
- Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
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)
