The effectiveness of the longest delivery time rule for the flow shop delivery time problem

DOI10.1002/nav.10054zbMath1030.90036OpenAlexW2125787749MaRDI QIDQ4432720

Philip M. Kaminsky

Publication date: 29 October 2003

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.10054

zbMATH Keywords

on-line algorithmsasymptotic optimalitymaximum delivery completion timecomputational testinglongest delivery time algorithmLongest Delivery Time among Available Jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (5)

Integrated production and outbound distribution scheduling problems with job release dates and deadlines ⋮ Effective on-line algorithms for reliable due date quotation and large-scale scheduling ⋮ Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates ⋮ Scheduling and due‐date quotation in a make‐to‐order supply chain ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times

This page was built for publication: The effectiveness of the longest delivery time rule for the flow shop delivery time problem