ILS Heuristics for the Single-Machine Scheduling Problem with Sequence-Dependent Family Setup Times to Minimize Total Tardiness
This paper addresses a single-machine scheduling problem with sequence-dependent family setup times. In this problem the jobs are classified into families according to their similarity characteristics. Setup times are required on each occasion when the machine switches from processing jobs in one fa...
Saved in:
| Main Authors: | Vinícius Vilar Jacob, José Elias C. Arroyo |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2016/9598041 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Minimizing Tardiness in a Scheduling Environment with Jobs' Hierarchy
by: Michal Sinai, et al.
Published: (2021-09-01) -
Hybrid genetic algorithm to minimize scheduling cost with unequal and job dependent earliness tardiness cost
by: Prasad Bari, et al.
Published: (2023-11-01) -
Total Tardiness Minimization in a Single-Machine with Periodical Resource Constraints
by: Bruno Prata, et al.
Published: (2022-12-01) -
Deep Q-Networks for Minimizing Total Tardiness on a Single Machine
by: Kuan Wei Huang, et al.
Published: (2024-12-01) -
Flow Shop Scheduling Using a Combination of Ant Colony Optimization Algorithm and Tabu Search Algorithm to Minimize Total Tardiness
by: Hana Merlina Hesti Bestari, et al.
Published: (2024-09-01)