Titlebook: Scheduling; Theory, Algorithms, Michael L. Pinedo Textbook 20165th edition Springer Science+Business Media, LLC 2016 Scheduling.Decision-m

ETHOS

书目名称Scheduling影响因子(影响力)




书目名称Scheduling影响因子(影响力)学科排名




书目名称Scheduling网络公开度




书目名称Scheduling网络公开度学科排名




书目名称Scheduling被引频次




书目名称Scheduling被引频次学科排名




书目名称Scheduling年度引用




书目名称Scheduling年度引用学科排名




书目名称Scheduling读者反馈




书目名称Scheduling读者反馈学科排名

期满

Single Machine Models (Deterministic) complicated machine environments. In practice, scheduling problems in more complicated machine environments are often decomposed into subproblems that deal with single machines. For example, a complicated machine environment with a single bottleneck may give rise to a single machine model.

Affable

Job Shops (Deterministic)shop has to visit certain machines more than once, the job is said to recirculate. Recirculation is a common phenomenon in the real world. For example, in semiconductor manufacturing jobs have to recirculate several times before they complete all their processing.

挡泥板

胡言乱语

Single Machine Models (Deterministic)ingle machine models often have properties that neither machines in parallel nor machines in series have. The results that can be obtained for single machine models not only provide insights into the single machine environment, but they also provide a basis for heuristics that are applicable to more

glacial

Parallel Machine Models (Deterministic)it is a generalization of the single machine, and a special case of the flexible flow shop. From a practical point of view, it is important because the occurrence of resources in parallel is common in the real world. Also, techniques for machines in parallel are often used in decomposition procedure

裂口

神化怪物

AXIOM

Stochastic Models: Preliminariest include machine breakdowns and unexpected releases of high priority jobs. Another source of uncertainty lies in the processing times, which are often not precisely known in advance. A good model for a scheduling problem should address these forms of uncertainty.

Range-Of-Motion

General Purpose Procedures for Deterministic Schedulingted with relative ease in industrial scheduling systems. All the techniques described are heuristics that do not guarantee an . solution; they instead aim at finding reasonably good solutions in a relatively short time. The heuristics tend to be fairly generic and can be adapted easily to a large va