Single machine scheduling with a variable common due date and resource-dependent processing times.

DOI10.1016/S0305-0548(02)00066-7MaRDI QIDQ1413814zbMATH OpenOpenAlexFDO

Authors D. Massart

Publication date 17 November 2003

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0305-0548(02)00066-7

zbMATH Keywords

Controllable processing timesSingle machine schedulingCommon due date assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine scheduling with common due date and controllable processing times
• Single machine scheduling subject to deadlines and resource dependent processing times
• Single-machine scheduling with time-and-resource-dependent processing times
• Single machine scheduling problems with resource dependent processing times
• Single-machine scheduling with waiting-time-dependent due dates
• Single machine scheduling and due date assignment with positionally dependent processing times
• Single machine scheduling problem with a common deadline and resource dependent release dates
• Single machine batch scheduling with deadlines and resource dependent processing times
• Single machine scheduling with resource dependent release times and processing times
• On single machine scheduling and due dateassignment with positionally dependent processing times

Cites work

• scientific article; zbMATH DE number 5995471 (Why is no real title available?)
• scientific article; zbMATH DE number 1128827 (Why is no real title available?)
• A bicriterion approach to time/cost trade-offs in sequencing
• A survey of results for sequencing problems with controllable processing times
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single machine scheduling with discretely controllable processing times
• Survey of scheduling research involving due date determination decisions
• Time-optimal control in a single machine problem with resource constraints

Cited in

(30)

• Single machine common flow allowance scheduling with controllable processing times
• Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine
• A new approach to the learning effect: Beyond the learning curve restrictions
• Single machine scheduling with common due date and controllable processing times
• A scheduling problem with job values given as a power function of their completion times
• Single CNC machine scheduling with controllable processing times and multiple due dates
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
• Optimal control of production processes with variable execution times
• Single-machine scheduling problems with variable processing times and past-sequence-dependent delivery times
• A unified approach for scheduling with convex resource consumption functions using positional penalties
• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• A survey of scheduling with controllable processing times
• Minimax scheduling problem with common due-date and controlled processing times and resource restriction
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times
• A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
• Preemptive repayment policy for multiple loans
• A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• Single machine scheduling problems with controllable processing times and total absolute differences penalties
• Minimizing total tardiness on a single machine with controllable processing times
• A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
• Scheduling with due date assignment under special conditions on job processing
• Single machine earliness-tardiness scheduling with resource-dependent release dates
• Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

This page was built for publication: Single machine scheduling with a variable common due date and resource-dependent processing times.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1413814)