Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times

Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lo...

Full description

Bibliographic Details
Main Authors: Lotfi Hidri, Anis Gharbi, Mohamed Aly Louly
Format: Article
Language:English
Published: Hindawi Limited 2014-01-01
Series:The Scientific World Journal
Online Access:http://dx.doi.org/10.1155/2014/605198
id doaj-caca6df040b44d24bcf8f8266e485d1d
record_format Article
spelling doaj-caca6df040b44d24bcf8f8266e485d1d2020-11-25T01:11:10ZengHindawi LimitedThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/605198605198Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal TimesLotfi Hidri0Anis Gharbi1Mohamed Aly Louly2Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi ArabiaIndustrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi ArabiaIndustrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi ArabiaWe focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.http://dx.doi.org/10.1155/2014/605198
collection DOAJ
language English
format Article
sources DOAJ
author Lotfi Hidri
Anis Gharbi
Mohamed Aly Louly
spellingShingle Lotfi Hidri
Anis Gharbi
Mohamed Aly Louly
Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times
The Scientific World Journal
author_facet Lotfi Hidri
Anis Gharbi
Mohamed Aly Louly
author_sort Lotfi Hidri
title Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times
title_short Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times
title_full Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times
title_fullStr Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times
title_full_unstemmed Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times
title_sort efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times
publisher Hindawi Limited
series The Scientific World Journal
issn 2356-6140
1537-744X
publishDate 2014-01-01
description We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.
url http://dx.doi.org/10.1155/2014/605198
work_keys_str_mv AT lotfihidri efficientboundingschemesforthetwocenterhybridflowshopschedulingproblemwithremovaltimes
AT anisgharbi efficientboundingschemesforthetwocenterhybridflowshopschedulingproblemwithremovaltimes
AT mohamedalylouly efficientboundingschemesforthetwocenterhybridflowshopschedulingproblemwithremovaltimes
_version_ 1725172600996364288

Similar Items