Hybrid flow shop with multiprocessor task scheduling based on earliness and tardiness penalties

Hybrid flow shop with multiprocessor task scheduling based on earliness and tardiness penalties PurposeHybrid flow shop with multiprocessor task (HFSMT) has received considerable attention in recent years. The purpose of this paper is to consider an HFSMT scheduling under the environment of a common time window. The window size and location are considered to be given parameters. The research deals with the criterion of total penalty cost minimization incurred by earliness and tardiness of jobs. In this research, a new memetic algorithm in which a global search algorithm is accompanied with the local search mechanism is developed to solve the HFSMT with jobs having a common time window. The operating parameters of memetic algorithm have an important role on the quality of solution. In this paper, a full factorial experimental design is used to determining the best parameters of memetic algorithm for each problem type. Memetic algorithm is tested using HFSMT problems.Design/methodology/approachFirst, hybrid flow shop scheduling system and hybrid flow shop scheduling with multiprocessor task are defined. The applications of the hybrid flow shop system are explained. Also the background of hybrid flow shop with multiprocessor is given in the introduction. The features of the proposed memetic algorithm are described in Section 2. The experiment results are presented in Section 3.FindingsComputational experiments show that the proposed new memetic algorithm is an effective and efficient approach for solving the HFSMT under the environment of a common time window.Originality/valueThere is only one study about HFSMT scheduling with time window. This is the first study which added the windows to the jobs in HFSMT problems. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Enterprise Information Management Emerald Publishing

Hybrid flow shop with multiprocessor task scheduling based on earliness and tardiness penalties

Loading next page...
 
/lp/emerald-publishing/hybrid-flow-shop-with-multiprocessor-task-scheduling-based-on-5aDD5juaVc
Publisher
Emerald Publishing
Copyright
Copyright © Emerald Group Publishing Limited
ISSN
1741-0398
DOI
10.1108/JEIM-04-2017-0051
Publisher site
See Article on Publisher Site

Abstract

PurposeHybrid flow shop with multiprocessor task (HFSMT) has received considerable attention in recent years. The purpose of this paper is to consider an HFSMT scheduling under the environment of a common time window. The window size and location are considered to be given parameters. The research deals with the criterion of total penalty cost minimization incurred by earliness and tardiness of jobs. In this research, a new memetic algorithm in which a global search algorithm is accompanied with the local search mechanism is developed to solve the HFSMT with jobs having a common time window. The operating parameters of memetic algorithm have an important role on the quality of solution. In this paper, a full factorial experimental design is used to determining the best parameters of memetic algorithm for each problem type. Memetic algorithm is tested using HFSMT problems.Design/methodology/approachFirst, hybrid flow shop scheduling system and hybrid flow shop scheduling with multiprocessor task are defined. The applications of the hybrid flow shop system are explained. Also the background of hybrid flow shop with multiprocessor is given in the introduction. The features of the proposed memetic algorithm are described in Section 2. The experiment results are presented in Section 3.FindingsComputational experiments show that the proposed new memetic algorithm is an effective and efficient approach for solving the HFSMT under the environment of a common time window.Originality/valueThere is only one study about HFSMT scheduling with time window. This is the first study which added the windows to the jobs in HFSMT problems.

Journal

Journal of Enterprise Information ManagementEmerald Publishing

Published: Oct 8, 2018

There are no references for this article.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off