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

DOI10.1016/S0305-0548(02)00066-7zbMath1047.90022OpenAlexW2035264267MaRDI QIDQ1413814

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

Single machine schedulingControllable processing timesCommon due date assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of results for sequencing problems with controllable processing times
• Time-optimal control in a single machine problem with resource constraints
• Survey of scheduling research involving due date determination decisions
• A bicriterion approach to time/cost trade-offs in sequencing
• Single machine scheduling with discretely controllable processing times
• Sequencing with Earliness and Tardiness Penalties: A Review
• 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