Bin packing and multiprocessor scheduling problems with side constraint on job types.
I. MoriharaT. IbarakiT. HasegawaPublished in: Discret. Appl. Math. (1983)
Keyphrases
- bin packing
- scheduling problem
- processing times
- flowshop
- assembly line balancing
- np hard
- job shop
- single machine
- graph colouring
- limited capacity
- maximum lateness
- release dates
- search tree
- tabu search
- packing problem
- single machine scheduling problem
- job shop scheduling
- job shop scheduling problem
- parallel machines
- identical machines
- branch and bound algorithm
- constraint satisfaction
- special case