Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines

DOI10.1057/jors.1993.4zbMath0772.90050OpenAlexW1973805410MaRDI QIDQ5289354

Bahram Alidaee, Shrikant S. Panwalkar

Publication date: 23 August 1993

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

Full work available at URL: https://doi.org/10.1057/jors.1993.4

zbMATH Keywords

heuristicsmakespanpolynomial time algorithmcommon due datetransportation problemidentical machinesabsolute latenessnon-identical machines (in parallel)single operation jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

Just-in-Time Scheduling with Equal-Size Jobs ⋮ Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs ⋮ A multi-agent system for the weighted earliness tardiness parallel machine problem ⋮ A fuzzy-linguistic approach to a multi-criteria sequencing problem ⋮ A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date ⋮ Scheduling under a common due-date on parallel unrelated machines ⋮ Two parallel machine sequencing problems involving controllable job processing times ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research

This page was built for publication: Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines