Flow shop non-idle scheduling and resource-constrained scheduling

Yen Shing Tsai, Miao-Tsong Lin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

In a two-machine flow shop, the problem seeks to select and schedule jobs such that the processing of the selected jobs does not contain any idle time. The objective is to maximize the number of selected jobs. The problem is studied in the context of a resource-constrained scheduling problem. An (Formula presented.) dynamic programming algorithm is proposed. The problem becomes ordinary NP-hard when job weights are introduced. A heuristic is designed and its performance ratio is analysed to be 3.

Original languageEnglish
Pages (from-to)577-585
Number of pages9
JournalAnnals of Operations Research
Volume238
Issue number1-2
DOIs
StatePublished - Mar 2016

Keywords

  • Dynamic programming
  • Financial planning
  • Flow shop
  • Performance analysis
  • Resource constraints

Fingerprint Dive into the research topics of 'Flow shop non-idle scheduling and resource-constrained scheduling'. Together they form a unique fingerprint.

Cite this