Flow shop production scheduling problem with queue time constraint using Lagrangian relaxation
碩士 === 國立臺灣大學 === 工業工程學研究所 === 104 === The hybrid flow shop scheduling (HFS) problem has drawn much attention in the past decades. Common examples of the HFS problem can be found in many industries, which usually accompanies with a lot of queue time constraints, the violations of which can lead to s...
Main Authors: | Chin-Chen Chou, 周錦辰 |
---|---|
Other Authors: | 洪一薰 |
Format: | Others |
Language: | en_US |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/65102198274904745326 |
Similar Items
-
Dual Flow Shops Scheduling with Queue Time Constraint
by: Lin, Chao-Hung, et al.
Published: (2009) -
Job-splitting and Batching Hybrid Flow Shop Scheduling Problem with Queue Time Constraints
by: Hao-Huai Chen, et al.
Published: (2014) -
The Lagrangean Relaxation for the Flow Shop Scheduling Problem with Precedence Constraints, Release Dates and Delivery Times
by: Marcelus Fabri, et al.
Published: (2019-01-01) -
Scheduling multiclass queueing networks and job shops using fluid and semidefinite relaxations
by: Sethuraman, Jayachandran, 1970-
Published: (2005) -
A Different Approach to Nurse Scheduling Problem: Lagrangian Relaxation
by: Yücel Öztürkoğlu
Published: (2020-12-01)