Back to Results
First PageMeta Content
Mathematical optimization / Planning / Scheduling / Batch processing / Job shop scheduling / Job scheduler / Constraint programming / Batch file / Computing / Software engineering / Computer programming


A New MIP Model for Parallel-Batch Scheduling with Non-Identical Job Sizes Sebastian Kosch and J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toronto, Toronto, Ontario M5S 3G8, Canada
Add to Reading List

Document Date: 2014-06-02 11:29:55

Open Document

File Size: 472,52 KB

Share Result on Facebook

Company

Dupont / Heinz / /

Currency

pence / /

/

Facility

Industrial Engineering University of Toronto / /

IndustryTerm

maximum processing time / printing / host job processing time ph / branch-and-price algorithm / canonical feasible solution / manufacturing settings / parallel-batch processing problem / semiconductor manufacturing / longest processing time / primal solutions / integral solution / batch processing time / batch processing / /

MarketIndex

EDD / /

Organization

University of Toronto / Toronto / Non-Identical Job Sizes Sebastian Kosch and J. Christopher Beck Department of Mechanical / /

Person

J. Christopher Beck / /

Position

model for the problem / /

Technology

semiconductor / MIP technology / detailed branch-and-price algorithm / branch-and-price algorithm / /

SocialTag