|
|
|
|
|
Che Han Lim and Seung Ki Moon
In a flexible job shop problem with transportation (FJSPT), a typical flexible manufacturing system comprises transporters that pick up and deliver jobs for processing at flexible job shops. This problem has grown in importance through the wide use of au...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shubhendu Kshitij Fuladi and Chang-Soo Kim
In the real world of manufacturing systems, production planning is crucial for organizing and optimizing various manufacturing process components. The objective of this paper is to present a methodology for both static scheduling and dynamic scheduling. ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Atabak Elmi, Dhananjay R. Thiruvady and Andreas T. Ernst
Cyclic scheduling is of vital importance in a repetitive discrete manufacturing environment. We investigate scheduling in the context of general cyclic job shops with blocking where there are no intermediate buffers between the machines. We also consider...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yajun Wang, Junyu Leng, Xiaoqi Liu, Jiajia Wang and Qiunan Meng
Various production disturbances occurring in the flexible job shop production process may affect the production of the workshop, some of which may lead to the prolongation of production completion time. Therefore, a flexible job shop dynamic scheduling m...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jian Li, Huankun Li, Pengbo He, Liping Xu, Kui He and Shanhui Liu
Green manufacturing has become a new production mode for the development and operation of modern and future manufacturing industries. The flexible job shop scheduling problem (FJSP), as one of the key core problems in the field of green manufacturing pro...
ver más
|
|
|
|
|
|
|
|
|
|
|
Pavel V. Matrenin
Planning tasks are important in construction, manufacturing, logistics, and education. At the same time, scheduling problems belong to the class of NP-hard optimization problems. Ant colony algorithm optimization is one of the most common swarm intellige...
ver más
|
|
|
|
|
|
|
|
|
|
|
Danial Rooyani and Fantahun Defersha
The work in this paper is motivated by a recently published article in which the authors developed an efficient two-stage genetic algorithm for a comprehensive model of a flexible job-shop scheduling problem (FJSP). In this paper, we extend the applicati...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mingming Xu, Shuning Zhang and Guanlong Deng
When no-wait constraint holds in job shops, a job has to be processed with no waiting time from the first to the last operation, and the start time of a job is greatly restricted. Using key elements of the iterated greedy algorithm, this paper proposes a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jiri Stastny, Vladislav Skorpil, Zoltan Balogh and Richard Klein
In this paper we introduce the draft of a new graph-based algorithm for optimization of scheduling problems. Our algorithm is based on the Generalized Lifelong Planning A* algorithm, which is usually used for path planning for mobile robots. It was teste...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bruno Cunha, Ana Madureira, Benjamim Fonseca and João Matos
In this paper, we present and discuss an innovative approach to solve Job Shop scheduling problems based on machine learning techniques. Traditionally, when choosing how to solve Job Shop scheduling problems, there are two main options: either use an eff...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuri N. Sotskov, Natalja M. Matsveichuk and Vadzim D. Hatsura
We study two-machine shop-scheduling problems provided that lower and upper bounds on durations of n jobs are given before scheduling. An exact value of the job duration remains unknown until completing the job. The objective is to minimize the makespan ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Piotr Jedrzejowicz and Izabela Wierzbowska
One of the possible approaches to solving difficult optimization problems is applying population-based metaheuristics. Among such metaheuristics, there is a special class where searching for the best solution is based on the collective behavior of decent...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hongchan Li, Haodong Zhu and Tianhua Jiang
In recent decades, workshop scheduling has excessively focused on time-related indicators, while ignoring environmental metrics. With the advent of sustainable manufacturing, the energy-aware scheduling problem has been attracting more and more attention...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xiaolin Gu, Ming Huang and Xu Liang
For solving the complex flexible job-shop scheduling problem, an improved genetic algorithm with adaptive variable neighborhood search (IGA-AVNS) is proposed. The improved genetic algorithm first uses a hybrid method combining operation sequence (OS) ran...
ver más
|
|
|
|
|
|
|
|
|
|
|
Julia Lange and Frank Werner
The job shop scheduling problem with blocking constraints and total tardiness minimization represents a challenging combinatorial optimization problem of high relevance in production planning and logistics. Since general-purpose solution approaches strug...
ver más
|
|
|
|
|
|
|
|
|
|
|
Marco Antonio Cruz-Chávez, Jesús del C. Peralta-Abarca and Martín H. Cruz-Rosales
This research allows improving the schedule of jobs in manufacturing workshops and this increases the amount of products without having the need to increase the production machines.
|
|
|
|
|
|
|
|
|
|
|
Atif Shahzad and Nasser Mebarki
A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitio...
ver más
|
|
|
|
|
|
|
|
|
|
|
Renata Melo e Silva de Oliveira,Maria S. F. O. de C. Ribeiro
Pág. 211 - 238
|
|
|
|
|
|
|
|
|
|
|
Frank Werner, Larysa Burtseva and Yuri N. Sotskov
This special issue of Algorithms is a follow-up issue of an earlier one, entitled ?Algorithms for Scheduling Problems?. In particular, the new issue is devoted to the development of exact and heuristic scheduling algorithms. Submissions were welcome both...
ver más
|
|
|
|
|
|
|
|
|
|
|
Predrag Mitic, Suzana Petrovic Savic, Aleksandar Djordjevic, Milan Eric, Enes Sukic, Dejan Vidojevic and Miladin Stefanovic
This research focuses on small- and medium-sized businesses that provide machining or other process services but do not produce their own products. Their daily manufacturing schedule varies according to client needs. Small- and medium-sized businesses st...
ver más
|
|
|
|
|
|