Show simple item record

Exact and Heuristic Scheduling Algorithms

dc.contributor.authorWerner, Frank*
dc.contributor.authorSotskov, Yuri*
dc.contributor.authorBurtseva, Larysa*
dc.date.accessioned2021-02-11T13:13:34Z
dc.date.available2021-02-11T13:13:34Z
dc.date.issued2020*
dc.date.submitted2020-04-07 23:07:09*
dc.identifier44830*
dc.identifier.urihttps://directory.doabooks.org/handle/20.500.12854/47162
dc.description.abstractThis edited book presents new results in the area of the development of exact and heuristic scheduling algorithms. It contains eight articles accepted for publication for a Special Issue in the journal Algorithms. The book presents new algorithms, e.g., for flow shop, job shop, and parallel machine scheduling problems. The particular articles address subjects such as a heuristic for the routing and scheduling problem with time windows, applied to the automotive industry in Mexico, a heuristic for the blocking job shop problem with tardiness minimization based on new neighborhood structures, fast heuristics for the Euclidean traveling salesman problem or a new mathematical model for the period-aggregated resource leveling problem with variable job duration, and several others.*
dc.languageEnglish*
dc.subjectTA1-2040*
dc.subjectT1-995*
dc.subject.classificationthema EDItEUR::T Technology, Engineering, Agriculture, Industrial processes::TB Technology: general issues::TBX History of engineering and technologyen_US
dc.subject.otherrepairing scheme*
dc.subject.othermakespan*
dc.subject.othercomplexity*
dc.subject.otheruniform parallel machine problems*
dc.subject.otherflow shop*
dc.subject.otheruniform parallel machines*
dc.subject.othertotal tardiness*
dc.subject.otherpermutations*
dc.subject.otheruncertainty*
dc.subject.othershop floor performance*
dc.subject.otherheuristic algorithm*
dc.subject.others-precedence constraints*
dc.subject.otherheuristics*
dc.subject.othertime windows*
dc.subject.otherauto-carrier transportation problem (ACTP)*
dc.subject.otherblocking*
dc.subject.othercomputational experiment*
dc.subject.otherscheduling*
dc.subject.othermanufacturing*
dc.subject.otheroptimal algorithm*
dc.subject.otherprecedence constraints*
dc.subject.otherflowshop*
dc.subject.otherflow-shop*
dc.subject.otherflow shop problem*
dc.subject.othersimulated annealing*
dc.subject.othertraveling salesman problem*
dc.subject.otherresource leveling*
dc.subject.othermakespan criterion*
dc.subject.otherproject scheduling*
dc.subject.otheruncertain duration*
dc.subject.othertime complexity*
dc.subject.otherheuristic*
dc.subject.otherquadratic programming*
dc.subject.otherfeasible loading*
dc.subject.otherexact algorithms*
dc.subject.otherresource leveling problem*
dc.subject.otherjob shop problem*
dc.subject.otherunavailability constraints*
dc.subject.otherjob shop*
dc.subject.otherjob-shop*
dc.subject.otherjob shop scheduling*
dc.titleExact and Heuristic Scheduling Algorithms*
dc.typebook
oapen.identifier.doi10.3390/books978-3-03928-469-6*
oapen.relation.isPublishedBy46cabcaa-dd94-4bfe-87b4-55023c1b36d0*
oapen.relation.isbn9783039284696*
oapen.relation.isbn9783039284689*
oapen.pages200*
oapen.edition1st*


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

https://creativecommons.org/licenses/by-nc-nd/4.0/
Except where otherwise noted, this item's license is described as https://creativecommons.org/licenses/by-nc-nd/4.0/