On J -maximal and J -minimal Flow-Shop Schedules

DOI10.1145/322261.322265zbMath0461.68034OpenAlexW2045096187MaRDI QIDQ3911381

Long-Lieh Tsai, Francis Y. L. Chin

Publication date: 1981

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322261.322265

zbMATH Keywords

NP-completejob schedulingminimum finishing time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items

The three-machine proportionate open shop and mixed shop minimum makespan problems ⋮ The proportionate flow shop total tardiness problem ⋮ Approximation algorithms for the three-machine proportionate mixed shop scheduling ⋮ Proportionate flow shop: New complexity results and models with due date assignment ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

This page was built for publication: On J -maximal and J -minimal Flow-Shop Schedules