Biobjective Scheduling for Joint Parallel Machines with Sequence-Dependent Setup by Taking Pareto-Based Approach
Modern factories have been moving toward just-in-time manufacturing paradigm. Optimal resource scheduling is therefore essential to minimize manufacturing cost and product delivery delay. This paper therefore focuses on scheduling multiple unrelated parallel machines, via Pareto approach. With the p...
Saved in:
| Main Authors: | Wichai Srisuruk, Kanchala Sudtachat, Paramate Horkaew |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Modelling and Simulation in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2021/6663375 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Modified Pareto Ant Colony Optimization Approach to Solve Biobjective Weapon-Target Assignment Problem
by: You Li, et al.
Published: (2017-01-01) -
An Efficient Biobjective Heuristic for Scheduling Workflows on Heterogeneous DVS-Enabled Processors
by: Pengji Zhou, et al.
Published: (2014-01-01) -
ILS Heuristics for the Single-Machine Scheduling Problem with Sequence-Dependent Family Setup Times to Minimize Total Tardiness
by: Vinícius Vilar Jacob, et al.
Published: (2016-01-01) -
Scheduling with sequence-dependent setup times in short-term production planning: A main path analysis-based review
by: Kuo-Ching Ying, et al.
Published: (2025-06-01) -
Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time
by: Jabrane Belabid, et al.
Published: (2020-01-01)