Parallel-Batch Scheduling With Deterioration and Group Technology

Parallel-batch scheduling with deterioration and group technology is a modern scheduling model, in which the jobs are classified into groups by the similar production requirements, and setup time, which may be fixed or deterioration function of the starting time, is required between jobs of differen...

Full description

Bibliographic Details
Main Author: Cuixia Miao
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8805058/
_version_ 1818910195423641600
author Cuixia Miao
author_facet Cuixia Miao
author_sort Cuixia Miao
collection DOAJ
description Parallel-batch scheduling with deterioration and group technology is a modern scheduling model, in which the jobs are classified into groups by the similar production requirements, and setup time, which may be fixed or deterioration function of the starting time, is required between jobs of different groups. We consider this scheduling to minimize the makespan in this paper. Based on Fully Batching Longest Deteriorating Rate, we show that our two single-machine scheduling problems are solved in polynomial time. Procedure Partition (A, F, ρ) is useful for designing algorithm in combinational optimization. We use this procedure to present fully polynomial time approximation schemes for our two parallel-machine scheduling problems, which is the best algorithm as its' objective value can be fully close to the optimal value.
first_indexed 2024-12-19T22:38:57Z
format Article
id doaj.art-85f65522fbc942eb9848d4edeee8b92f
institution Directory Open Access Journal
issn 2169-3536
language English
last_indexed 2024-12-19T22:38:57Z
publishDate 2019-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj.art-85f65522fbc942eb9848d4edeee8b92f2022-12-21T20:03:08ZengIEEEIEEE Access2169-35362019-01-01711908211908610.1109/ACCESS.2019.29360048805058Parallel-Batch Scheduling With Deterioration and Group TechnologyCuixia Miao0https://orcid.org/0000-0003-2448-2158School of Mathematics Science, Qufu Normal University, Qufu, ChinaParallel-batch scheduling with deterioration and group technology is a modern scheduling model, in which the jobs are classified into groups by the similar production requirements, and setup time, which may be fixed or deterioration function of the starting time, is required between jobs of different groups. We consider this scheduling to minimize the makespan in this paper. Based on Fully Batching Longest Deteriorating Rate, we show that our two single-machine scheduling problems are solved in polynomial time. Procedure Partition (A, F, ρ) is useful for designing algorithm in combinational optimization. We use this procedure to present fully polynomial time approximation schemes for our two parallel-machine scheduling problems, which is the best algorithm as its' objective value can be fully close to the optimal value.https://ieeexplore.ieee.org/document/8805058/Parallel-batch schedulingdeteriorationgroup technologyfully polynomial time approximation scheme
spellingShingle Cuixia Miao
Parallel-Batch Scheduling With Deterioration and Group Technology
IEEE Access
Parallel-batch scheduling
deterioration
group technology
fully polynomial time approximation scheme
title Parallel-Batch Scheduling With Deterioration and Group Technology
title_full Parallel-Batch Scheduling With Deterioration and Group Technology
title_fullStr Parallel-Batch Scheduling With Deterioration and Group Technology
title_full_unstemmed Parallel-Batch Scheduling With Deterioration and Group Technology
title_short Parallel-Batch Scheduling With Deterioration and Group Technology
title_sort parallel batch scheduling with deterioration and group technology
topic Parallel-batch scheduling
deterioration
group technology
fully polynomial time approximation scheme
url https://ieeexplore.ieee.org/document/8805058/
work_keys_str_mv AT cuixiamiao parallelbatchschedulingwithdeteriorationandgrouptechnology