Scheduling Unrelated Parallel Machines in Semiconductor Manufacturing by Problem Reduction and Local Search Heuristics
碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 97 === We investigate a difficult scheduling problem in a semiconductor manufacturing process that seeks to minimize the number of tardy jobs and makespan with sequence-dependent setup time, release time, due dates and tool constraints. We propose a mixed integer...
Main Authors: | Chih-wei Chen, 陳志偉 |
---|---|
Other Authors: | I-Lin Wang |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/44925428830632330575 |
Similar Items
-
THE ABURAS HEURISTIC: A MODIFIED HEURISTIC FOR SCHEDULING UNRELATED PARALLEL MACHINE PROBLEMS
by: H.M. Aburas
Published: (2012-01-01) -
Several heuristic algorithms for the scheduling problem of unrelated parallel machines with mold constraints
by: 李欣黛
Published: (2008) -
Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
by: Ebrahim Asadi Gangraj
Published: (2017-03-01) -
An Evolutionary Variable Neighbourhood Search for the Unrelated Parallel Machine Scheduling Problem
by: Salwani Abdullah, et al.
Published: (2021-01-01) -
Archive-Based Optimization Heuristics for Fuzzy Multi-Objective Unrelated Parallel Machine Scheduling Problems
by: Ai-Lian Jhong, et al.
Published: (2009)