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
-
Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem
by: Seyed Hassan Shams Lahroudi, et al.
Published: (2022-01-01) -
List Of Pareto Optimal Solutions of a Biobjective Shortest Path Problem
by: Lasko Laskov, et al.
Published: (2023-09-01) -
Pareto Optimal Solutions of the Biobjective Minimum Length Minimum Risk Spanning Trees Problem
by: Lasko Laskov, et al.
Published: (2024-10-01) -
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)