Scheduling with monotonous earliness and tardiness penalties

DOI10.1016/0377-2217(93)90181-LzbMath0776.90036OpenAlexW1991038719MaRDI QIDQ2366084

Helmut G. Kahlbacher

Publication date: 29 June 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90181-l

zbMATH Keywords

just-in-timedue-datespseudopolynomial algorithmone machinenonpreemptable jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems, Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs, Processing-plus-wait due dates in single-machine scheduling, An M-objective penalty function algorithm under big penalty parameters, A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date, On the smoothing of the square-root exact penalty function for inequality constrained optimization, Single machine scheduling to minimize weighted earliness subject to maximum tardiness, A composite heuristic for the single machine early/tardy job scheduling problem., An Objective Penalty Function Algorithm for Bilevel Programming Based on Multi-Parameters, Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem, A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems, Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties, Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method, A survey of the state-of-the-art of common due date assignment and scheduling research

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A V-shape property of optimal schedule of jobs about a common due date
• Optimal common due-date with limited completion time deviation
• Survey of scheduling research involving due date determination decisions
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• Single-machine scheduling to minimize earliness and number of tardy jobs
• A fully polynomial approximation scheme for the total tardiness problem
• 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
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• Single- and multiple-processor models for minimizing completion time variance
• A Generalized Model of Optimal Due-Date Assignment by Linear Programming
• Minimizing the average deviation of job completion times about a common due-date: An extension
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• A Note on the Common Due-Date Assignment Problem
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Variance Minimization in Single Machine Sequencing Problems