Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed

Computers and Operations Research

Volumn 29, Issue 3, 2002, Pages 275-294

  Sung, Chang Sup ^a   Kim, Young Hwan ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Batch processing machine; Dynamic arrival; Flowshop; Scheduling

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

DISCRETE PROCESSING MACHINES;

OPERATIONS RESEARCH;

MACHINERY;

EID: 0036489508     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00071-X     Document Type: Article

References (20)

1. Dynamic batching heuristic for simultaneous processing
2. Batching and scheduling jobs on batch and discrete processors
3. A review of production planning and scheduling models in the semiconductor industry - Part I: System characteristics, performance evaluation and production planning
4. Scheduling groups of jobs on a single machine
5. Minimizing total completion time on a batch processing machine with job families
6. Minimizing total completion time on batch processing machines
7. Scheduling semiconductor burn-in operations to minimize total flowtime
8. Efficient algorithms for scheduling semiconductor burn-in operations
9. Scheduling with agreeable release times and due on a batch processing machine
10. Minimizing makespan on a single burn-in oven in semiconductor manufacturing
11. Scheduling a single batch processing machine with non-identical job sizes
12. Batching and scheduling to minimize the makespan in the two-machine flowshop
13. Scheduling algorithms for a single batch processing machine
14. Scheduling batch processing machines with incompatible job families
15. Minimizing total tardiness on a batch processing machine with incompatible job families
16. Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed
17. Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
18. A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
19. A proof of the optimality of the shortest remaining processing time discipline