Scheduling jobs on parallel machines with sequence-dependent family set-up times

International Journal of Advanced Manufacturing Technology

Volumn 19, Issue 12, 2002, Pages 926-932

  Eom, D H ^a   Shin, H J ^a   Kwun, I H ^a   Shim, J K ^a   Kim, S S ^a  

^a Korea University   (South Korea)

Author keywords

Heuristics; Parallel machines; Scheduling; Sequence dependent family set up times; Total weighted tardiness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; COSTS; HEURISTIC METHODS; LIQUID CRYSTAL DISPLAYS; POLYNOMIALS; PROBLEM SOLVING;

APPARENT TARDINESS COST WITH SET-UP; PARALLEL MACHINES; SEQUENCE-DEPENDENT FAMILY SET-UP TIMES;

SCHEDULING;

EID: 0036067263     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001700200105     Document Type: Article

References (14)

1. Minimizing total tardinesses on one machine is NP-hard
2. A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness
3. A decomposition algorithm for the single machine total tardiness problem
4. Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs
5. The batch loading and scheduling problem
6. Scheduling batch processing machines with incompatible job families
7. Rolling horizon algorithms for a single machine dynamic scheduling problem with sequence dependent set-up times
8. Parallel machine scheduling with release dates, due dates and family set-up times
9. Scheduling jobs on parallel machines with sequence-dependent set-up times
10. Solving job shop scheduling problem with tabu search
11. Using tabu search to solve the common due date early/tardy machine scheduling problem