Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem
The problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD) for a set of jobs when their weights equal 1 (unweighted problem). This objective became very significant after the intr...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2016-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2016/6591632 |
id |
doaj-1823d4daea0b4d679b4777fd2669468e |
---|---|
record_format |
Article |
spelling |
doaj-1823d4daea0b4d679b4777fd2669468e2020-11-24T23:26:24ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472016-01-01201610.1155/2016/65916326591632Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling ProblemMohammed Al-Salem0Leonardo Bedoya-Valencia1Ghaith Rabadi2Qatar University, Doha, QatarColorado State University-Pueblo, Pueblo, CO, USAOld Dominion University, Norfolk, VA, USAThe problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD) for a set of jobs when their weights equal 1 (unweighted problem). This objective became very significant after the introduction of the Just in Time manufacturing approach. A procedure to determine whether the CDD is restricted or unrestricted is developed and a semirestricted CDD is defined. Algorithms are introduced to find the optimal solution when the CDD is unrestricted and semirestricted. When the CDD is restricted, which is a much harder problem, a heuristic algorithm is proposed to find approximate solutions. Through computational experiments, the heuristic algorithms’ performance is evaluated with problems up to 500 jobs.http://dx.doi.org/10.1155/2016/6591632 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Mohammed Al-Salem Leonardo Bedoya-Valencia Ghaith Rabadi |
spellingShingle |
Mohammed Al-Salem Leonardo Bedoya-Valencia Ghaith Rabadi Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem Mathematical Problems in Engineering |
author_facet |
Mohammed Al-Salem Leonardo Bedoya-Valencia Ghaith Rabadi |
author_sort |
Mohammed Al-Salem |
title |
Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem |
title_short |
Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem |
title_full |
Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem |
title_fullStr |
Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem |
title_full_unstemmed |
Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem |
title_sort |
heuristic and exact algorithms for the two-machine just in time job shop scheduling problem |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2016-01-01 |
description |
The problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD) for a set of jobs when their weights equal 1 (unweighted problem). This objective became very significant after the introduction of the Just in Time manufacturing approach. A procedure to determine whether the CDD is restricted or unrestricted is developed and a semirestricted CDD is defined. Algorithms are introduced to find the optimal solution when the CDD is unrestricted and semirestricted. When the CDD is restricted, which is a much harder problem, a heuristic algorithm is proposed to find approximate solutions. Through computational experiments, the heuristic algorithms’ performance is evaluated with problems up to 500 jobs. |
url |
http://dx.doi.org/10.1155/2016/6591632 |
work_keys_str_mv |
AT mohammedalsalem heuristicandexactalgorithmsforthetwomachinejustintimejobshopschedulingproblem AT leonardobedoyavalencia heuristicandexactalgorithmsforthetwomachinejustintimejobshopschedulingproblem AT ghaithrabadi heuristicandexactalgorithmsforthetwomachinejustintimejobshopschedulingproblem |
_version_ |
1725555306362044416 |