Results 1 to 10 of about 2,778 (120)
Modeling a single machine scheduling problem with batch production and the random breakdown and solving it by branch and bound method [PDF]
Purpose: Scheduling of batch production and machine disruption are the two main challenges in manufacturing organizations. Due to the complexity of production processes, many industries try to group jobs according to family criteria and use a common ...
Ehsan Molaee +2 more
doaj +1 more source
This article presents two combinatorial genetic algorithms (GA), unequal earliness tardiness-GA (UET-GA) and job-dependent earliness tardiness-GA (JDET-GA) for the single-machine scheduling problem to minimize earliness tardiness (ET) cost.
Prasad Bari, Prasad Karande, Vaidehi Bag
doaj +1 more source
AIT-S for Single-Machine Weighted Tardiness Problem [PDF]
This paper concentrates on the newly improved algorithm for solving the single-machine total weighted tardiness (SMTWT) problem, called Algorithm Inspired by Tree and Sorting (AIT-S).
Kacper Petrynski +3 more
doaj +1 more source
The Due Window Assignment Problems with Deteriorating Job and Delivery Time
This paper considers the single machine scheduling problem with due window, delivery time and deteriorating job, whose goal is to minimize the window location, window size, earliness and tardiness.
Jin Qian, Yu Zhan
doaj +1 more source
A Survey of the Literature on Order-Picking Systems by Combining Planning Problems
Companies have been trying continuously to reduce their logistics costs in the current competitive markets. Warehouses are important components of the logistics systems and they must be managed effectively and efficiently to reduce the production cost as
Amir Reza Ahmadi Keshavarz +3 more
doaj +1 more source
Parallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm [PDF]
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic ...
Javad Behnamian
doaj +1 more source
In this paper, we are discussing a research project aiming to optimize the scheduling of production orders within a real application in the packaging field.
Soukaina Oujana +3 more
doaj +1 more source
Heuristic Approaches for Solving bi-objective Single Machine Scheduling Problems [PDF]
In this research paper, n jobs have to be scheduled on one-machine to minimize the sum of maximum earliness and maximum tardiness. We solved a series of bi-criteria scheduling problems that related to minimize the sum of the maximum earliness and ...
Hawzhin Salh, Ayad Ramadan
doaj +1 more source
Background. In preemptive job scheduling, which is a part of the flow-shop sequencing tasks, one of the most crucial goals is to obtain a schedule whose total tardiness would be minimal.
Vadim V. Romanuke
doaj +1 more source
Modeling and optimizing a multi-objective flow shop scheduling problem to minimize energy consumption, completion time and tardiness [PDF]
Energy consumption considerations in production systems have recently attracted the attention of researchers. In conventional production scheduling models, the importance has more often been given to time-related rather than to energy-related performance
Mohsen Bagheri +2 more
doaj +1 more source

