Determination of an optimal common due date and optimal sequence in a single machine job shop

DOI10.1080/00207548808947888zbMath0644.90047OpenAlexW2073713084MaRDI QIDQ3787779

C. R. Bector, Yash Pal Gupta, Mahesh C. Gupta

Publication date: 1988

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548808947888

zbMATH Keywords

sensitivity analysisdue dateslinear goal programmingone-machine job-sequencing

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items

Survey of scheduling research involving due date determination decisions, Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties, Common due-date determination and sequencing using tabu search, V-shape property of optimal sequence of jobs about a common due date on a single machine, Mimimization of agreeably weighted variance in single machine systems, CON due-date determination and sequencing, Minimization of total absolute deviation for a common due date, Scheduling to minimize weighted earliness and tardiness about a common due-date, A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date, Optimal due-date assignment and sequencing, On the general solution for a class of early/tardy problems, Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs, Multicriteria scheduling problems: a survey, Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method, Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs, A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems, A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem, A survey of the state-of-the-art of common due date assignment and scheduling research, Single machine scheduling with symmetric earliness and tardiness penalties

Cites Work

• Unnamed Item
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Optimal due-date assignment in a job shop†
• Minimizing mean absolute deviation of completion times about a common due date
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem