Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs

From MaRDI portal
Publication:4363720

DOI10.1287/mnsc.42.11.1544zbMath0879.90115OpenAlexW2016677107MaRDI QIDQ4363720

Awi Federgruen, Gur Mosheiov

Publication date: 25 January 1998

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7ca9d8126ea607b196e50757043cb92e1cef64c7




Related Items (22)

Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costsBranch-and-price approach for robust parallel machine scheduling with sequence-dependent setup timesMinimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approachCompletion time variance minimisation on two identical parallel processorsA lower bound for weighted completion time varianceAn exact quadratic programming approach based on convex reformulation for seru scheduling problemsTime-flexible min completion time variance in a single machine by quadratic programmingA 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 machineMinimizing earliness and tardiness subject to total completion time in an identical parallel machine systemA branch and price algorithm for single-machine completion time varianceA multi-agent system for the weighted earliness tardiness parallel machine problemScheduling with common due date, earliness and tardiness penalties for multimachine problems: a surveyMinmax earliness-tardiness costs with unit processing time jobsHierarchical minimization of completion time variance and makespan in jobshopsAn application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel ElectronicsParallel machine scheduling with a common due windowHierarchical production planning and scheduling in a multi-product, batch process environmentCompletion time variance minimization in single machine and multi-machine systemsMultiple common due datesAn exact algorithm to minimize mean squared deviation of job completion times about a common due dateParallel machine earliness and tardiness scheduling with proportional weights




This page was built for publication: Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs