Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties

DOI10.1057/jors.1994.106zbMath0829.90077OpenAlexW2054065841MaRDI QIDQ4300228

Zhi-Long Chen, Cheng, T. C. Edwin

Publication date: 17 January 1996

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

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

zbMATH Keywords

earliness and tardiness penaltiesschedulingparallel machinespenalty functionNP-hardness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

A graph coloring approach to the deployment scheduling and unit assignment problem ⋮ Optimal due date assignment in multi-machine scheduling environments ⋮ An agent-based negotiation model on price and delivery date in a fashion supply chain ⋮ 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 ⋮ Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ Single machine scheduling to minimize the number of early and tardy jobs ⋮ A heuristic for single machine common due date assignment problem with different earliness/tardiness weights ⋮ Just-in-Time Scheduling with Equal-Size Jobs ⋮ Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. ⋮ Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system ⋮ Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs ⋮ Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties ⋮ 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 ⋮ Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs ⋮ Multicriteria scheduling problems: a survey ⋮ Due dates assignment and JIT scheduling with equal-size jobs ⋮ A common due-data assignment problem on parallel identical machines ⋮ Parallel machine scheduling with a common due window ⋮ Hierarchical production planning and scheduling in a multi-product, batch process environment ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem ⋮ Multiple common due dates ⋮ Due-date assignment on uniform machines ⋮ Two-agent scheduling on uniform parallel machines with min-max criteria ⋮ Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs ⋮ The parallel machine min-max weighted absolute lateness scheduling problem ⋮ Scheduling with batch setup times and earliness-tardiness penalties ⋮ Scheduling identical jobs and due-window on uniform machines ⋮ Scheduling under a common due-date on parallel unrelated machines ⋮ 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 ⋮ Due-window assignment with identical jobs on parallel uniform machines