國立臺灣大學電機工程學系Hsieh, Ming-MingMing-MingHsieh2006-09-282018-07-062006-09-282018-07-062004-11-01http://ntur.lib.ntu.edu.tw//handle/246246/2006092815521156Job Shop-Scheduling Problem(JSP) A set of job is to be completed Each job consists of a series of operations Each operation needs a certain machine for a processing time Constraints Non-preemption constraints Precedence constraints Single assignment constraint Capacity constraints Objective : minimize total weighted tardinessapplication/ppt189952 bytesapplication/vnd.ms-powerpointzh-TWreporthttp://ntur.lib.ntu.edu.tw/bitstream/246246/2006092815521156/1/auction based job shop scheduling problem 1.ppt