Scheduling Algorithms [electronic resource] /

Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent change over times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are polynomial algorithms, dynamic programming procedures, branch-and-bound algorithms and local search heuristics. Also complexity issues are addressed.

Saved in:
Bibliographic Details
Main Authors: Brucker, Peter. author., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1995
Subjects:Business., Operations research., Decision making., Information technology., Business, Control engineering., Robotics., Mechatronics., Engineering economics., Engineering economy., Economic theory., Business and Management., Operation Research/Decision Theory., Control, Robotics, Mechatronics., Engineering Economics, Organization, Logistics, Marketing., Economic Theory/Quantitative Economics/Mathematical Methods., IT in Business.,
Online Access:http://dx.doi.org/10.1007/978-3-662-03088-2
Tags: Add Tag
No Tags, Be the first to tag this record!