Job shop scheduling problem (JSSP)
The job shop scheduling problem is a special case of the general shop in which each job i consists of n tasks Tij with processing times pij (j=l, ... ,m) where Tij has to be processed on machine Mij, and the tasks have to be scheduled in predetermined given order. The job shop problem is to...
Saved in:
Main Author: | Abdullah, Nurul Azma |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2004
|
Subjects: | |
Online Access: | http://eprints.uthm.edu.my/7723/1/24p%20NURUL%20AZMA%20ABDULLAH.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem
by: Sh Ahmad, Sh Salleh
Published: (2009) -
Solving a multi-objective job shop scheduling problem using a hybrid genetic algorithm
by: Piroozfard, Hamed
Published: (2013) -
Bottleneck-based heuristic for three-machine flow shop scheduling
by: Abdul Rahim, Mohd Salleh
Published: (2011) -
Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling
by: Anuar, Nurul Izah
Published: (2022) -
Optimization-based simulation algorithm for predictive-reactive job-shop scheduling of reconfigurable manufacturing systems
by: Tan, Joe Yee
Published: (2022)