Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem-Reference-Cited by-同舟云学术

Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem

Published:2016 Issue: Volume:2016 Page:1-11
ISSN:1024-123X
Container-title:Mathematical Problems in Engineering
language:en
Short-container-title:Mathematical Problems in Engineering

Author:

Al-Salem Mohammed¹^ORCID,Bedoya-Valencia Leonardo²^ORCID,Rabadi Ghaith³^ORCID

Affiliation:

1. Qatar University, Doha, Qatar

2. Colorado State University-Pueblo, Pueblo, CO, USA

3. Old Dominion University, Norfolk, VA, USA

Abstract

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.

Publisher

Hindawi Limited

Subject

General Engineering,General Mathematics

Link

http://downloads.hindawi.com/journals/mpe/2016/6591632.pdf

Reference38 articles.

1. Minimizing the average deviation of job completion times about a common due date

2. Minimizing the sum of absolute lateness in single-machine and multimachine scheduling

3. Single-machine scheduling to minimize absolute deviation of completion times from a common due date

4. Minimizing mean absolute deviation of completion times about a common due date

5. Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving two-machine flow shop scheduling problem with total weighted number of on-time tasks maximization criterion on D-Wave quantum computer;2023 IEEE 23rd International Symposium on Computational Intelligence and Informatics (CINTI);2023-11-20

2. The Just-In-Time Job-Shop Rescheduling with Rush Orders by Using a Meta-Heuristic Algorithm;2021 IEEE 17th International Conference on Automation Science and Engineering (CASE);2021-08-23

3. A meta-heuristic to solve the just-in-time job-shop scheduling problem;European Journal of Operational Research;2021-01

4. The just-in-time job-shop scheduling problem with distinct due-dates for operations;Journal of Heuristics;2020-11-03

5. Blocks of Jobs for Solving Two-Machine Flow Shop Problem with Normal Distributed Processing Times;Advances in Intelligent Systems and Computing;2020-08-29