Two models for a family of flowshop sequencing problems

European Journal of Operational Research

Volumn 142, Issue 2, 2002, Pages 282-293

  Stafford Jr , Edward F ^a   Tseng, Fan T ^a  

^a UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

Flowshop; No intermediate queues; Scheduling; Sequence dependent

Indexed keywords

CONSTRAINT THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; QUEUEING THEORY; SCHEDULING;

FLOWSHOP SEQUENCING PROBLEMS;

OPERATIONS RESEARCH;

EID: 0037120684     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00320-4     Document Type: Conference Paper

References (23)

1. A heuristic algorithm for the flowshop problem with a common job sequence on all machines
2. Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
3. A review of scheduling research involving setup considerations
4. A review of flowshop scheduling research with setup times
5. Optimal flowshop schedules with no intermediate storage space
6. Application of the branch-and-bound technique to some flow-shop scheduling problems
7. Optimal two- and three-stage production schedules with set-up times included
8. Evaluation of scheduling techniques for solving flowshop problems with no intermediate storage
9. Flowshop scheduling/sequencing research: A statistical review of the literature, 1952-1994
10. Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups
11. A MILP model for the n-job, m-stage flowshop with sequence dependent set-up times
12. On the development of a mixed-integer linear programming model for the standard flowshop
13. On the Srikar-Ghosh MILP model for the N × M SDST flowshop problem
14. Two MILP models for the SSIST flowshop sequencing problem
15. Optimal elimination methods in the m ×n flow-shop scheduling problem
16. Two MILP models for the N × M SDST flowshop sequencing problem
17. An integer linear-programming model for machine scheduling
18. Solution of the flowshop-scheduling problem with no intermediate queues
19. Optimal two-stage production scheduling with setup times separated