Job Shop Scheduling Problem and Solution Algorithms: A Review

Cebi, Ceren; Ataç, Enes; Şahingöz, Özgür Koray

doi:10.1109/icccnt49239.2020.9225581

Cited by 7 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The production system considered in this research falls into the job shop situation, which aims to schedule several jobs over some machines in which each job has a unique machine route. A review of the problem and solution algorithm for job shop scheduling was given by [20]. We mainly consider the type of job shop where multiple identical machines with multi-processing capability are available to service jobs, called Flexible Job Shop (FJS) [21].…”

Section: Introductionmentioning

confidence: 99%

Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan

Pakpahan,

Sumarna

2023

JTI

View full text Add to dashboard Cite

This research examined the scheduling of jobs with multiple stages unto identical parallel machines to minimize the makespan. The work is motivated by a Flexible Manufacturing System case that produces various parts and has multiple machining centers. Early research towards this system proposed a stage-by-stage independent scheduling, resulting in a non-optimal solution. This study aimed to create a better solution for the system by developing a novel heuristic algorithm based on the classical longest processing time algorithm and simultaneously considering processing time for all stages when deciding the job sequencing and job-machine allocation. The algorithm is defined as Modified LPT for Multiple Identical Machine with Multi-process Capability (M-LPT MIMMPC). We performed a numerical experiment to assess the algorithm's performance by incorporating various cases. We concluded that the resulting makespans are always better than LPT's theoretical bound for parallel machine scheduling. In some cases, it successfully gave an optimal value. Although the experiment scope was still limited, the algorithm showed promising performance results.

show abstract

Section: Introductionmentioning

confidence: 99%

Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan

Pakpahan,

Sumarna

2023

JTI

View full text Add to dashboard Cite

show abstract

“…e job-shop scheduling problem (JSP) is a well-known NP-hard optimization problem [1][2][3]. JSP involves scheduling jobs onto machines in order to minimize makespan, i.e., the schedule's length.…”

Section: Introductionmentioning

confidence: 99%

A Two‐Level Metaheuristic for the Job‐Shop Scheduling Problem with Multipurpose Machines

Pongchairerks

2022

Complexity

View full text Add to dashboard Cite

This paper proposes a two-level metaheuristic consisting of lower- and upper-level algorithms for the job-shop scheduling problem with multipurpose machines. The lower-level algorithm is a local search algorithm used for finding an optimal solution. The upper-level algorithm is a population-based metaheuristic used to control the lower-level algorithm’s input parameters. With the upper-level algorithm, the lower-level algorithm can reach its best performance on every problem instance. Most changes of the proposed two-level metaheuristic from its original variants are in the lower-level algorithm. A main purpose of these changes is to increase diversity into solution neighborhood structures. One of the changes is that the neighbor operators of the proposed lower-level algorithm are developed to be more adjustable. Another change is that the roulette-wheel technique is applied for selecting a neighbor operator and for generating a perturbation operator. In addition, the proposed lower-level algorithm uses an adjustable delay-time limit to select an optional machine for each operation. The performance of the proposed two-level metaheuristic was evaluated on well-known benchmark instances. The evaluation’s results indicated that the proposed two-level metaheuristic performs well on most benchmark instances.

show abstract

VGATS-JSSP: Variant Genetic Algorithm and Tabu Search Applied to the Job Shop Scheduling Problem

Assafra

Alaya

Zidi

et al. 2023

Lecture Notes in Networks and Systems

View full text Add to dashboard Cite

Job Shop Scheduling Problem and Solution Algorithms: A Review

Cited by 7 publications

References 26 publications

Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan

Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan

A Two‐Level Metaheuristic for the Job‐Shop Scheduling Problem with Multipurpose Machines

VGATS-JSSP: Variant Genetic Algorithm and Tabu Search Applied to the Job Shop Scheduling Problem

Contact Info

Product

Resources

About