Minimizing total completion time in two-stage hybrid flow shop with dedicated machines

We consider the problem of minimizing total completion time in a two-stage hybrid flow shop scheduling problem with dedicated machines at stage 2. There exist one machine at stage 1 and two machines at stage 2. Each job must be processed on the single machine at stage 1 and depending upon the job ty...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2011-07, Vol.38 (7), p.1045-1053
1. Verfasser:	Yang, Jaehwan
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Completion time Computational complexity Errors Exact sciences and technology Heuristic Inventory control, production control. Distribution Job shops Machine shops Mathematical models Mathematics Operational research and scientific management Operational research. Management science Operations research Optimization Optimization algorithms Probability and statistics Production scheduling Scheduling Scheduling, sequencing Sciences and techniques of general use Statistics Studies Two-stage hybrid flow shop Worst case bound on relative error
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!