A Polynomial Time Approximation Scheme for Parallel Machine Scheduling with Machine Availability Constraints

碩士 === 國立中央大學 === 工業管理研究所 === 106 === This study analyzes the makespan minimization problem of non-preemptively scheduling identical parallel machines where machines may be unavailable during arbitrary time intervals. Assuming at least one machine is always available throughout the planning horizon,...

Full description

Bibliographic Details
Main Authors:	Shu-Ping Chou, 周書平
Other Authors:	Yin-Chieh Yeh
Format:	Others
Language:	en_US
Published:	2018
Online Access:	http://ndltd.ncl.edu.tw/handle/2rfyk8

id	ndltd-TW-106NCU05041039
record_format	oai_dc
spelling	ndltd-TW-106NCU050410392019-10-24T05:19:40Z http://ndltd.ncl.edu.tw/handle/2rfyk8 A Polynomial Time Approximation Scheme for Parallel Machine Scheduling with Machine Availability Constraints Shu-Ping Chou 周書平碩士國立中央大學工業管理研究所 106 This study analyzes the makespan minimization problem of non-preemptively scheduling identical parallel machines where machines may be unavailable during arbitrary time intervals. Assuming at least one machine is always available throughout the planning horizon, this setting is relevant practically and academically. For example, the unavailability occurs when machines are under preventive maintenance. So far as this study is concerned, no polynomial-time approximation scheme (PTAS) via structuring the input data has been proposed. This study aims to provide the first polynomial-time approximation scheme (PTAS) by adding structure to the input. Yin-Chieh Yeh 葉英傑 2018 學位論文 ; thesis 47 en_US
collection	NDLTD
language	en_US
format	Others
sources	NDLTD
description	碩士 === 國立中央大學 === 工業管理研究所 === 106 === This study analyzes the makespan minimization problem of non-preemptively scheduling identical parallel machines where machines may be unavailable during arbitrary time intervals. Assuming at least one machine is always available throughout the planning horizon, this setting is relevant practically and academically. For example, the unavailability occurs when machines are under preventive maintenance. So far as this study is concerned, no polynomial-time approximation scheme (PTAS) via structuring the input data has been proposed. This study aims to provide the first polynomial-time approximation scheme (PTAS) by adding structure to the input.
author2	Yin-Chieh Yeh
author_facet	Yin-Chieh Yeh Shu-Ping Chou 周書平
author	Shu-Ping Chou 周書平
spellingShingle	Shu-Ping Chou 周書平 A Polynomial Time Approximation Scheme for Parallel Machine Scheduling with Machine Availability Constraints
author_sort	Shu-Ping Chou
title	A Polynomial Time Approximation Scheme for Parallel Machine Scheduling with Machine Availability Constraints
title_short	A Polynomial Time Approximation Scheme for Parallel Machine Scheduling with Machine Availability Constraints
title_full	A Polynomial Time Approximation Scheme for Parallel Machine Scheduling with Machine Availability Constraints
title_fullStr	A Polynomial Time Approximation Scheme for Parallel Machine Scheduling with Machine Availability Constraints
title_full_unstemmed	A Polynomial Time Approximation Scheme for Parallel Machine Scheduling with Machine Availability Constraints
title_sort	polynomial time approximation scheme for parallel machine scheduling with machine availability constraints
publishDate	2018
url	http://ndltd.ncl.edu.tw/handle/2rfyk8
work_keys_str_mv	AT shupingchou apolynomialtimeapproximationschemeforparallelmachineschedulingwithmachineavailabilityconstraints AT zhōushūpíng apolynomialtimeapproximationschemeforparallelmachineschedulingwithmachineavailabilityconstraints AT shupingchou polynomialtimeapproximationschemeforparallelmachineschedulingwithmachineavailabilityconstraints AT zhōushūpíng polynomialtimeapproximationschemeforparallelmachineschedulingwithmachineavailabilityconstraints
_version_	1719276849243095040

A Polynomial Time Approximation Scheme for Parallel Machine Scheduling with Machine Availability Constraints

Similar Items