Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process

This paper considers preemption and idle time are allowed in a single machine scheduling problem with just-in-time (JIT) approach. It incorporates Earliness/Tardiness (E/T) penalties, interruption penalties and holding cost of jobs which are waiting to be processed as work-in-process (WIP). Generall...

Full description

Bibliographic Details
Main Authors: Mohammad Kazemi, Elnaz Nikoofarid, Amin Aalaei, Reza Kia
Format: Article
Language:English
Published: Growing Science 2012-04-01
Series:International Journal of Industrial Engineering Computations
Subjects:
Online Access:http://www.growingscience.com/ijiec/Vol3/IJIEC_2012_13.pdf
id doaj-b7970cc4d5094e42ab6bb177e19639c9
record_format Article
spelling doaj-b7970cc4d5094e42ab6bb177e19639c92020-11-24T23:13:02ZengGrowing ScienceInternational Journal of Industrial Engineering Computations1923-29261923-29342012-04-0133321336Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process Mohammad KazemiElnaz NikoofaridAmin AalaeiReza KiaThis paper considers preemption and idle time are allowed in a single machine scheduling problem with just-in-time (JIT) approach. It incorporates Earliness/Tardiness (E/T) penalties, interruption penalties and holding cost of jobs which are waiting to be processed as work-in-process (WIP). Generally in non-preemptive problems, E/T penalties are a function of the completion time of the jobs. Then, we introduce a non-linear preemptive scheduling model where the earliness penalty depends on the starting time of a job. The model is liberalized by an elaborately–designed procedure to reach the optimum solution. To validate and verify the performance of proposed model, computational results are presented by solving a number of numerical examples.http://www.growingscience.com/ijiec/Vol3/IJIEC_2012_13.pdfJust-in-timePreemptionEarliness/TardinessInterruption PenaltiesWork-In-ProcessSingle Machine Scheduling
collection DOAJ
language English
format Article
sources DOAJ
author Mohammad Kazemi
Elnaz Nikoofarid
Amin Aalaei
Reza Kia
spellingShingle Mohammad Kazemi
Elnaz Nikoofarid
Amin Aalaei
Reza Kia
Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process
International Journal of Industrial Engineering Computations
Just-in-time
Preemption
Earliness/Tardiness
Interruption Penalties
Work-In-Process
Single Machine Scheduling
author_facet Mohammad Kazemi
Elnaz Nikoofarid
Amin Aalaei
Reza Kia
author_sort Mohammad Kazemi
title Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process
title_short Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process
title_full Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process
title_fullStr Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process
title_full_unstemmed Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process
title_sort just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process
publisher Growing Science
series International Journal of Industrial Engineering Computations
issn 1923-2926
1923-2934
publishDate 2012-04-01
description This paper considers preemption and idle time are allowed in a single machine scheduling problem with just-in-time (JIT) approach. It incorporates Earliness/Tardiness (E/T) penalties, interruption penalties and holding cost of jobs which are waiting to be processed as work-in-process (WIP). Generally in non-preemptive problems, E/T penalties are a function of the completion time of the jobs. Then, we introduce a non-linear preemptive scheduling model where the earliness penalty depends on the starting time of a job. The model is liberalized by an elaborately–designed procedure to reach the optimum solution. To validate and verify the performance of proposed model, computational results are presented by solving a number of numerical examples.
topic Just-in-time
Preemption
Earliness/Tardiness
Interruption Penalties
Work-In-Process
Single Machine Scheduling
url http://www.growingscience.com/ijiec/Vol3/IJIEC_2012_13.pdf
work_keys_str_mv AT mohammadkazemi justintimepreemptivesinglemachineproblemwithcostsofearlinesstardinessinterruptionandworkinprocess
AT elnaznikoofarid justintimepreemptivesinglemachineproblemwithcostsofearlinesstardinessinterruptionandworkinprocess
AT aminaalaei justintimepreemptivesinglemachineproblemwithcostsofearlinesstardinessinterruptionandworkinprocess
AT rezakia justintimepreemptivesinglemachineproblemwithcostsofearlinesstardinessinterruptionandworkinprocess
_version_ 1725599728861708288