On Two-machine Flow Shop Scheduling

Lin Chen; Wen Chang Luo; Guo Chuan Zhang

doi:10.1007/s40305-014-0055-x

On Two-machine Flow Shop Scheduling

Lin Chen, Wen Chang Luo, Guo Chuan Zhang

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

In this note, we revisit the classical two-machine flow shop scheduling problem. A linear time approximation scheme is presented. For an online version with rejection, we propose best possible online algorithms.

Original language	English
Pages (from-to)	333-339
Number of pages	7
Journal	Journal of the Operations Research Society of China
Volume	2
Issue number	3
DOIs	https://doi.org/10.1007/s40305-014-0055-x
State	Published - Sep 1 2014

Keywords

Flow shop
Linear time
Online algorithm

Access to Document

10.1007/s40305-014-0055-x

Cite this

@article{f6d84de5834e45eb98547b3b8e38231f,

title = "On Two-machine Flow Shop Scheduling",

abstract = "In this note, we revisit the classical two-machine flow shop scheduling problem. A linear time approximation scheme is presented. For an online version with rejection, we propose best possible online algorithms.",

keywords = "Flow shop, Linear time, Online algorithm",

author = "Lin Chen and Luo, {Wen Chang} and Zhang, {Guo Chuan}",

note = "Publisher Copyright: {\textcopyright} 2014, Operations Research Society of China, Periodicals Agency of Shanghai University, and Springer-Verlag Berlin Heidelberg.",

year = "2014",

month = sep,

day = "1",

doi = "10.1007/s40305-014-0055-x",

language = "English",

volume = "2",

pages = "333--339",

journal = "Journal of the Operations Research Society of China",

issn = "2194-668X",

number = "3",

}

TY - JOUR

T1 - On Two-machine Flow Shop Scheduling

AU - Chen, Lin

AU - Luo, Wen Chang

AU - Zhang, Guo Chuan

PY - 2014/9/1

Y1 - 2014/9/1

N2 - In this note, we revisit the classical two-machine flow shop scheduling problem. A linear time approximation scheme is presented. For an online version with rejection, we propose best possible online algorithms.

AB - In this note, we revisit the classical two-machine flow shop scheduling problem. A linear time approximation scheme is presented. For an online version with rejection, we propose best possible online algorithms.

KW - Flow shop

KW - Linear time

KW - Online algorithm

UR - http://www.scopus.com/inward/record.url?scp=84907699247&partnerID=8YFLogxK

U2 - 10.1007/s40305-014-0055-x

DO - 10.1007/s40305-014-0055-x

M3 - Article

AN - SCOPUS:84907699247

SN - 2194-668X

VL - 2

SP - 333

EP - 339

JO - Journal of the Operations Research Society of China

JF - Journal of the Operations Research Society of China

IS - 3

ER -

On Two-machine Flow Shop Scheduling

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this