A Job-Shop Scheduling Model Using Genetic Algorithm and Giffler Thompson Approach [PDF]
, 2009 The major objective of this thesis topic is to study the challenging research subject of job shop scheduling with the intent of optimizing the makespan. The job - shop scheduling problem is one of the hardest combinatorial optimization problems. The main
Bumb, Nikhil Deepak
core +2 more sources
Research on steady-state simulation in dynamic job shop scheduling problem
Advances in Mechanical Engineering, 2015 A systematic research of steady state for the dynamic job shop scheduling problem with jobs releasing continuously over time has been conducted in this article.
Hegen Xiong +3 more
doaj +1 more source
Dynamic MPC-Based Scheduling in a Smart Manufacturing System Problem
IEEE Access, 2023 This paper introduces a dynamic scheduling algorithm designed to minimize makespan within a smart manufacturing system, accommodating delays in the production process.
Alessandro Bozzi +3 more
doaj +1 more source
A linear programming-based method for job shop scheduling [PDF]
, 2012 We present a decomposition heuristic for a large class of job shop scheduling problems. This heuristic utilizes information from the linear programming formulation of the associated optimal timing problem to solve subproblems, can be used for any ...
A. P. J. Vepsalainen +27 more
core +4 more sources
Job Shop Scheduling Benchmark: Environments and Instances for Learning and Non-learning Methods [PDF]
arXiv, 2023 Job shop scheduling problems address the routing and sequencing of tasks in a job shop setting. Despite significant interest from operations research and machine learning communities over the years, a comprehensive platform for testing and comparing solution methods has been notably lacking.
arxiv
AIS-SFHM APPROACH FOR OPTIMIZATION OF MULTI OBJECTIVE JOB SHOP PROBLEMS [PDF]
, 2017 The n-job, m-machine Job shop scheduling (JSP) problem is one of the general production scheduling problems. The JSP problem is a scheduling problem, where a set of ‘n’ jobs must be processed or assembled on a set of ‘m’ dedicated machines.
Manoharan, Chandrasekaran
core +1 more source
Monte-Carlo Tree-Search for Leveraging Performance of Blackbox Job-Shop Scheduling Heuristics [PDF]
arXiv, 2022 In manufacturing, the production is often done on out-of-the-shelf manufacturing lines, whose underlying scheduling heuristics are not known due to the intellectual property. We consider such a setting with a black-box job-shop system and an unknown scheduling heuristic that, for a given permutation of jobs, schedules the jobs for the black-box job ...
arxiv
Optimizing combination of job shop scheduling and quadratic assignment problem through multi-objective decision making approach [PDF]
Management Science Letters, 2012 In this paper, we consider job shop scheduling and machine location problem, simultaneously. Processing, transportation, and setup times are defined as deterministic parameters.
Mostafa Kazemi +2 more
doaj
Journal of Industrial Engineering and Management, 2021 Purpose: This research develops a batch scheduling model for a three-stage flow shop with job processors in the first and second stages and a batch processor in the third stage.
Pratya Poeri Suryadhini +3 more
doaj +1 more source
An efficient polynomial-time approximation scheme for parallel multi-stage open shops [PDF]
arXiv, 2022 Various new scheduling problems have been arising from practical production processes and spawning new research areas in the scheduling field. We study the parallel multi-stage open shops problem, which generalizes the classic open shop scheduling and parallel machine scheduling problems. Given m identical k-stage open shops and a set of n jobs, we aim
arxiv