4.4 Article

A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Operations Research & Management Science

An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs

Hatem Hadda et al.

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2010)

Article Operations Research & Management Science

An improved algorithm for the two machine flow shop problem with several availability constraints

Hatem Hadda

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2010)

Article Computer Science, Interdisciplinary Applications

A survey of scheduling with deterministic machine availability constraints

Ying Ma et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2010)

Article Computer Science, Interdisciplinary Applications

Approximation results for flow shop scheduling problems with machine availability constraints

Mikhail A. Kubzin et al.

COMPUTERS & OPERATIONS RESEARCH (2009)

Article Operations Research & Management Science

An FPTAS for scheduling a two-machine flowshop with one unavailability interval

CT Ng et al.

NAVAL RESEARCH LOGISTICS (2004)

Article Computer Science, Information Systems

An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint

J Breit

INFORMATION PROCESSING LETTERS (2004)

Article Management

Two-machine flow shops with limited machine availability

W Kubiak et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)

Article Operations Research & Management Science

An improved heuristic for two-machine flowshop scheduling with an availability constraint

TEC Cheng et al.

OPERATIONS RESEARCH LETTERS (2000)