Permutation Flow Shop Problem with Shortening Job Processing Times

Zhenyou Wang (), Cai-Min Wei and Yuan-Yuan Lu ()
Additional contact information
Zhenyou Wang: Faculty of Applied Mathematics, Guangdong University of Technology, Guangzhou 510520, P. R. China
Cai-Min Wei: Department of Mathematics, Shantou University, Shantou 515063, P. R. China3Guangdong Provincial Key Lab of Digital Signals and Image Processing, Shantou University, Shantou, Guangdong, 515063, P. R. China
Yuan-Yuan Lu: College of Mathematics, Jilin Normal University, Siping, Jilin 136000, P. R. China

Asia-Pacific Journal of Operational Research (APJOR), 2016, vol. 33, issue 04, 1-14

Abstract: In this paper, we consider a three-machine makespan minimization permutation flow shop scheduling problem with shortening job processing times. Shortening job processing times means that its processing time is a nonincreasing function of its execution start time. Optimal solutions are obtained for some special cases. For the general case, several dominance properties and two lower bounds are developed to construct a branch-and-bound (B&B) algorithm. Furthermore, we propose a heuristic algorithm to overcome the inefficiency of the branch-and-bound algorithm.

Keywords: Scheduling; permutation flow shop; shortening job processing times; makespan; branch-and-bound algorithm; heuristic algorithm (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595916500329
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:33:y:2016:i:04:n:s0217595916500329

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595916500329

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().