An electromagnetism-inspired method for a generalized flowshop problem
There are two common simplifying assumptions made in the scheduling of operations. One is that machines are available continuously, and the other is that once a job completes one process it is immediately available for its next. Moreover, in flowshops, it is commonly assumed that jobs must visit all...
Main Author: | Khalili Majid |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2014-01-01
|
Series: | Manufacturing Review |
Subjects: | |
Online Access: | https://mfr.edp-open.org/articles/mfreview/full_html/2014/01/mfreview130002/mfreview130002.html |
Similar Items
-
A Memetic Algorithm for Hybrid Flowshops with Flexible Machine
Availability Constraints
by: Fariborz Jolai, et al.
Published: (2010-02-01) -
A CRITICAL REVIEW OF THE NEWEST BIOLOGICALLY-INSPIRED ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM
by: JERZY DUDA
Published: (2007-01-01) -
A branch-and-bound algorithm to minimize total tardiness in a two-machine flowshop problem with different release time
by: June-Young BANG, et al.
Published: (2019-11-01) -
Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms
by: Kuo-Ching Ying, et al.
Published: (2017-01-01) -
Improved Beam Search for Optimizing No-Wait Flowshops With Release Times
by: Pourya Pourhejazy, et al.
Published: (2020-01-01)