Scheduling an unbounded batching machine with job processing time compatibilities.
Adrien BellangerAdam JaniakMikhail Y. KovalyovAmmar OulamaraPublished in: Discret. Appl. Math. (2012)
Keyphrases
- batch processing
- scheduling jobs
- flowshop
- scheduling problem
- single machine
- identical machines
- release dates
- identical parallel machines
- parallel machines
- processing times
- completion times
- maximum lateness
- precedence constraints
- sequence dependent setup times
- setup times
- parallel machine scheduling problem
- bicriteria
- unrelated parallel machines
- job processing times
- information systems
- shortest processing time
- strongly np hard
- preventive maintenance
- production scheduling
- production system
- resource allocation
- lower bound