Algorithms and Computation

DOI10.1007/B94771zbMath1205.90125OpenAlexW1769833081MaRDI QIDQ5191659

Hiroshi Nagamochi, Yoshiyuki Karuno

Publication date: 7 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94771

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (6)

Exact method for the two-machine flow-shop problem with time delays ⋮ Sequencing optimisation for makespan improvement at wet-etch tools ⋮ Polynomial-time approximation schemes for scheduling problems with time lags ⋮ Flowshop scheduling with interstage job transportation ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times ⋮ Two-machine flowshop scheduling problem with coupled-operations

This page was built for publication: Algorithms and Computation