Multiobjective flow-shop scheduling
- 1 December 1990
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 37 (6) , 981-995
- https://doi.org/10.1002/1520-6750(199012)37:6<981::aid-nav3220370617>3.0.co;2-h
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs TardyOperations Research, 1989
- Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of LatenessManagement Science, 1988
- Scheduling with Multiple Performance Measures: The One-Machine CaseManagement Science, 1986
- Hybrid algorithm for sequencing with bicriteriaJournal of Optimization Theory and Applications, 1983
- A bicriterion approach to time/cost trade-offs in sequencingEuropean Journal of Operational Research, 1982
- Solving a bicriterion scheduling problemEuropean Journal of Operational Research, 1980
- Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound SolutionManagement Science, 1977
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- A Comparative Study of Flow-Shop AlgorithmsOperations Research, 1975
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954