A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan

We address a two-machine flow shop on-line scheduling problem. Jobs arrive over time. Each job becomes available for processing at its release time after which it must be processed without preemption on the first machine and then on the second machine. The objective is to minimize the makespan. We p...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 51; pp. 251 - 256
Main Authors:	Liu, Peihai, Lu, Xiwen
Format:	Journal Article
Language:	English
Published:	Kidlington Elsevier Ltd 01.11.2014 Elsevier Pergamon Press Inc
Subjects:	Algorithms Applied sciences Competitive ratio Exact sciences and technology Flow shop Inventory control, production control. Distribution Job shops Mathematical problems Online Operational research and scientific management Operational research. Management science Operations research Optimization algorithms Production scheduling Scheduling Scheduling algorithms Scheduling, sequencing Studies Scheduling Flow shop Competitive ratio Online Preemption On line Multiple machine Priority Competitiveness Processing time Makespan Competitive algorithms Production management Deterministic algorithms Execution time
ISSN:	0305-0548, 1873-765X, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!