Show simple item record

AuthorAl-Salem, Mohammed
AuthorBedoya-Valencia, Leonardo
AuthorRabadi, Ghaith
Available date2021-09-07T06:16:14Z
Publication Date2016
Publication NameMathematical Problems in Engineering
ResourceScopus
ISSN1024123X
URIhttp://dx.doi.org/10.1155/2016/6591632
URIhttp://hdl.handle.net/10576/22770
AbstractThe 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. 2016 Mohammed Al-Salem et al.
Languageen
PublisherHindawi Limited
SubjectHeuristic algorithms
Just in time production
Optimization
Scheduling
Approximate solution
Common due date
Computational experiment
Earliness and tardiness
Exact algorithms
Job shop scheduling problems
Just-in-time manufacturing
Optimal solutions
Job shop scheduling
TitleHeuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem
TypeArticle
Volume Number2016
dc.accessType Open Access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record