Dynamic Programming Algorithms for Two-Machine Hybrid Flow-Shop Scheduling With a Given Job Sequence and Deadline
In “Shared Manufacturing” environment, orders are processed in a given job sequence which is based on the time of receipt of orders. This paper studies a problem of scheduling two-task jobs in a two-machine hybrid flow-shop subject to a given job sequence which is used in produ...
Main Authors: | Qi Wei, Yong Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9091166/ |
Similar Items
-
A New Sustainable Scheduling Method for Hybrid Flow-Shop Subject to the Characteristics of Parallel Machines
by: Lin Kong, et al.
Published: (2020-01-01) -
Energy-Aware Scheduling in Hybrid Flow Shop Using Firefly Algorithm
by: Ahmed Nedal Abid Al Kareem Jabari, et al.
Published: (2021-02-01) -
A Hybrid Genetic Algorithm for Flexible Job Shop Scheduling Problem With Sequence-Dependent Setup Times and Job Lag Times
by: Yilun Wang, et al.
Published: (2021-01-01) -
An application of effective genetic algorithms for Solving Hybrid Flow Shop Scheduling Problems
by: Cengiz Kahraman, et al.
Published: (2008-06-01) -
A hybrid algorithm for flexible job-shop scheduling problem with setup times
by: Ameni Azzouz, et al.
Published: (2017-01-01)