Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
From MaRDI portal
Publication:4363720
DOI10.1287/mnsc.42.11.1544zbMath0879.90115OpenAlexW2016677107MaRDI QIDQ4363720
Publication date: 25 January 1998
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7ca9d8126ea607b196e50757043cb92e1cef64c7
lower boundheuristicearliness and tardiness costsmultimachine schedulingasymptotic and probabilistic analysis
Related Items (22)
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs ⋮ Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach ⋮ Completion time variance minimisation on two identical parallel processors ⋮ A lower bound for weighted completion time variance ⋮ An exact quadratic programming approach based on convex reformulation for seru scheduling problems ⋮ Time-flexible min completion time variance in a single machine by quadratic programming ⋮ A branch and bound algorithm to minimize completion time variance on a single processor. ⋮ An almost exact solution to the min completion time variance in a single machine ⋮ Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system ⋮ A branch and price algorithm for single-machine completion time variance ⋮ A multi-agent system for the weighted earliness tardiness parallel machine problem ⋮ Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey ⋮ Minmax earliness-tardiness costs with unit processing time jobs ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics ⋮ Parallel machine scheduling with a common due window ⋮ Hierarchical production planning and scheduling in a multi-product, batch process environment ⋮ Completion time variance minimization in single machine and multi-machine systems ⋮ Multiple common due dates ⋮ 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: Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs