Scheduling of job-block with dead line in n 2 flowshop problem with separated set up times
From MaRDI portal
(Redirected from Publication:1060679)
Scheduling of job-block with dead line in n\(\times 2\) flowshop problem with separated set up times
Scheduling of job-block with dead line in n\(\times 2\) flowshop problem with separated set up times
The problem to be considered is one of scheduling n jobs in a two-machine flow shop. Jobs are characterized by processing times and set-up times. Moreover, some subsets of jobs are to be processed in a no-wait mode before specified deadlines. The objective is to find a schedule of minimum length. In the paper an optimization algorithm is proposed, its complexity, however, is not evaluated.
Recommendations
- Job lateness in a two-machine flowshop with setup times separated
- The two-machine sequence dependent flowshop scheduling problem
- Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
- Total flowtime in no-wait flowshops with separated setup times.
- Scheduling problem in a two-machine flow line with theN-step prior-job-dependent set-up times
Cited in
(4)- Job lateness in a two-machine flowshop with setup times separated
- Scheduling problem in a two-machine flow line with theN-step prior-job-dependent set-up times
- Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
- scientific article; zbMATH DE number 2111620 (Why is no real title available?)
This page was built for publication: Scheduling of job-block with dead line in n\(\times 2\) flowshop problem with separated set up times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060679)
