A multi-objective optimization for preemptive identical parallel machines scheduling problem

A multi-objective optimization for preemptive identical parallel machines scheduling problem This research investigates a new notion in just-in-time philosophy on the identical parallel machines considering allowable job preemption with respect to a bi-objective approach. The work-in-process (WIP) is also allowed, since minimization of WIP is desirable in many industrial applications specifically those including perishable items. In this new notion, a new model is defined in which the earliness costs depend on the start times of the jobs. The goal of this study is to minimize two objectives simultaneously: (1) total weighted earliness and tardiness as well as holding cost of all jobs which are waiting to be processed as WIP costs and (2) number of jobs interruptions. In this context, two multi-objective meta-heuristic algorithms, i.e., the non-dominated sorting genetic algorithm II (NSGAII) and non-dominated ranking genetic algorithm (NRGA) are employed to solve such bi-objective problems. Three measurement factors are then employed to evaluate the algorithms performances. Computational results demonstrate that NRGA outperforms NSGAII in all small- and medium-to-large-sized sample-generated problems; however, intangibly. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Computational and Applied Mathematics Springer Journals

A multi-objective optimization for preemptive identical parallel machines scheduling problem

Loading next page...
 
/lp/springer_journal/a-multi-objective-optimization-for-preemptive-identical-parallel-pkG84XOKwZ
Publisher
Springer Journals
Copyright
Copyright © 2015 by SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional
Subject
Mathematics; Applications of Mathematics; Computational Mathematics and Numerical Analysis; Mathematical Applications in the Physical Sciences; Mathematical Applications in Computer Science
ISSN
0101-8205
eISSN
1807-0302
D.O.I.
10.1007/s40314-015-0298-0
Publisher site
See Article on Publisher Site

Abstract

This research investigates a new notion in just-in-time philosophy on the identical parallel machines considering allowable job preemption with respect to a bi-objective approach. The work-in-process (WIP) is also allowed, since minimization of WIP is desirable in many industrial applications specifically those including perishable items. In this new notion, a new model is defined in which the earliness costs depend on the start times of the jobs. The goal of this study is to minimize two objectives simultaneously: (1) total weighted earliness and tardiness as well as holding cost of all jobs which are waiting to be processed as WIP costs and (2) number of jobs interruptions. In this context, two multi-objective meta-heuristic algorithms, i.e., the non-dominated sorting genetic algorithm II (NSGAII) and non-dominated ranking genetic algorithm (NRGA) are employed to solve such bi-objective problems. Three measurement factors are then employed to evaluate the algorithms performances. Computational results demonstrate that NRGA outperforms NSGAII in all small- and medium-to-large-sized sample-generated problems; however, intangibly.

Journal

Computational and Applied MathematicsSpringer Journals

Published: Dec 7, 2015

References

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, Elsevier, 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 lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off