A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM

DOI10.15807/jorsj.44.140zbMath1038.90032OpenAlexW2110224475MaRDI QIDQ4483536

Yoshiyuki Karuno, Jinliang Cheng, Hiroshi Kise

Publication date: 7 October 2003

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

Full work available at URL: https://doi.org/10.15807/jorsj.44.140

zbMATH Keywords

schedulingheuristic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

A hybrid heuristic to solve the parallel machines job-shop scheduling problem ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ The hybrid flow shop scheduling problem

This page was built for publication: A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM