A branch-and-bound algorithm to minimize total tardiness in a two-machine flowshop problem with different release time
In this study, we consider the scheduling problem for two-machine flowshops with jobs of the different release times. In many real situations, jobs can be arrived at different times due to progress of jobs in the preceding stage or the status of supply of raw materials. We set the objective function...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The Japan Society of Mechanical Engineers
2019-11-01
|
| Series: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
| Subjects: | |
| Online Access: | https://www.jstage.jst.go.jp/article/jamdsm/13/4/13_2019jamdsm0080/_pdf/-char/en |