Due-date assignment and early/tardy scheduling on identical parallel machines
From MaRDI portal
Publication:4279269
DOI<17::AID-NAV3220410103>3.0.CO;2-X 10.1002/1520-6750(199402)41:1<17::AID-NAV3220410103>3.0.CO;2-XzbMath0794.90022OpenAlexW2004096713MaRDI QIDQ4279269
Jay B. Ghosh, Prabuddha De, Charles E. Wells
Publication date: 31 August 1994
Full work available at URL: https://doi.org/10.1002/1520-6750(199402)41:1<17::aid-nav3220410103>3.0.co;2-x
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
Optimal due date assignment in multi-machine scheduling environments ⋮ Batching scheduling in a two-level supply chain with earliness and tardiness penalties ⋮ Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach ⋮ A heuristic for single machine common due date assignment problem with different earliness/tardiness weights ⋮ Just-in-Time Scheduling with Equal-Size Jobs ⋮ Earliness--tardiness production planning for just-in-time manufacturing: a unifying approach by goal programming ⋮ Common due-date assignment and scheduling on single machine with exponential processing times. ⋮ Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs ⋮ Minmax earliness-tardiness costs with unit processing time jobs ⋮ Real-time due-date promising by build-to-order environments ⋮ Parallel machine scheduling with a common due window ⋮ Hierarchical production planning and scheduling in a multi-product, batch process environment ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research ⋮ A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
