Minimizing the Makespan for a Two-Stage Three-Machine Assembly Flow Shop Problem with the Sum-of-Processing-Time Based Learning Effect
Two-stage production process and its applications appear in many production environments. Job processing times are usually assumed to be constant throughout the process. In fact, the learning effect accrued from repetitive work experiences, which leads to the reduction of actual job processing times...
Saved in:
| Main Author: | Win-Chin Lin |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2018/8170294 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Exact makespan minimization of unrelated parallel machines
by: Åblad, Edvin, et al.
Published: (2021-05-01) -
A Two-Stage Three-Machine Flow Shop Assembly Problem Mixed with a Controllable Number and Sum-of-Processing Times-Based Learning Effect by Simulated Annealing Algorithms
by: Shang-Chia Liu
Published: (2020-01-01) -
Online makespan minimization for MapReduce scheduling on multiple parallel machines
by: Zheng Quanchang, et al.
Published: (2024-11-01) -
Minimizing Makespan Scheduling on a Single Machine with General Positional Deterioration Effects
by: Yu Sun, et al.
Published: (2025-04-01) -
Multi-objective mathematical programs to minimize the makespan, the patients' flow time, and doctors' workloads variation using dispatching rules and genetic algorithm
by: Jerbi Badreddine, et al.
Published: (2025-01-01)