A bicriteria two-machine permutation flowshop problem
Authors:
- Funda Sivrikaya-ŞerifoğluFSFunda Sivrikaya-Şerifoğlu
- Gündüz UlusoyGUGündüz Ulusoy
- 1 June 1998
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 107 (2) , 414-430
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- The two-machine total completion time flow shop problemEuropean Journal of Operational Research, 1996
- Two branch and bound algorithms for the permutation flow shop problemEuropean Journal of Operational Research, 1996
- Minimizing total completion time in a two-machine flowshop: Analysis of special casesLecture Notes in Computer Science, 1996
- Complexity of single machine, multi-criteria scheduling problemsEuropean Journal of Operational Research, 1993
- A framework for single machine multiple objective sequencing researchOmega, 1989
- Bicriterion static scheduling research for a single machineOmega, 1988
- Optimality Criteria for Flowshop SchedulesA I I E Transactions, 1971
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954