Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
From MaRDI portal
Publication:3335507
DOI10.1002/NAV.3800310214zbMath0544.90052OpenAlexW2134958868MaRDI QIDQ3335507
P. S. Sundararaghavan, Mesbah U. Ahmed
Publication date: 1984
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800310214
computational resultscommon due dateidentical parallel machinesheuristic methodsum of absolute lateness
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (48)
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs ⋮ Simultaneous minimization of total completion time and total deviation of job completion times ⋮ The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ Scheduling with monotonous earliness and tardiness penalties ⋮ Machine scheduling with earliness, tardiness and non-execution penalties ⋮ Genetic search with dynamic operating disciplines ⋮ Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem ⋮ Single machine \(\text{MAD}/T_{\max}\) problem with a common due date ⋮ Optimal scheduling of jobs about a common due date on a single machine ⋮ A dual criteria sequencing problem with earliness and tardiness penalties ⋮ Minimizing flowtime and missed due-dates in single-machine sequencing ⋮ An alternative proof of optimality for the common due-date assignment problem ⋮ Survey of scheduling research involving due date determination decisions ⋮ A comparison of lower bounds for the single-machine early/tardy problem ⋮ The complexity of scheduling job families about a common due date ⋮ Scheduling about a common due date with earliness and tardiness penalties ⋮ Determination of an optimal common due date and optimal sequence in a single machine job shop ⋮ Dynamic programming approach to the single-machine sequencing problem with different due-dates ⋮ A branch and bound approach for single machine scheduling with earliness and tardiness penalties ⋮ Equivalence of mean flow time problems and mean absolute deviation problems ⋮ Exponential neighborhood search for a parallel machine scheduling problem ⋮ Scheduling to minimize weighted earliness and tardiness about a common due-date ⋮ Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system ⋮ On the general solution for a class of early/tardy problems ⋮ Common due date scheduling problem with separate earliness and tardiness penalties ⋮ Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties ⋮ Capacitated two-parallel machines scheduling to minimize sum of job completion times ⋮ Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey ⋮ Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date ⋮ Minmax earliness-tardiness costs with unit processing time jobs ⋮ Single machine weighted earliness-tardiness penalty problem with a common due date ⋮ Multicriteria scheduling problems: a survey ⋮ A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden ⋮ Algorithms for a class of single-machine weighted tardiness and earliness problems ⋮ Fast LP models and algorithms for identical jobs on uniform parallel machines ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem ⋮ Multiple common due dates ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems ⋮ A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date ⋮ Single machine scheduling to minimize mean absolute lateness: A heuristic solution ⋮ Scheduling under a common due-date on parallel unrelated machines ⋮ A branch and bound procedure to minimize mean absolute lateness on a single processor ⋮ Single machine earliness-tardiness scheduling with resource-dependent release dates ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research ⋮ An exact algorithm to minimize mean squared deviation of job completion times about a common due date ⋮ Parallel machine earliness and tardiness scheduling with proportional weights
This page was built for publication: Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
