Displaying similar documents to “Multicriteria scheduling problems: a survey”

Scheduling jobs in open shops with limited machine availability

Jacek Błażewicz, Piotr Formanowicz (2010)

RAIRO - Operations Research

Similarity:

In this paper, open shop scheduling problems with limited machine availability are studied. Such a limited availability of machines may appear in many real-life situations, as preventive maintenance activities. Three types of jobs are distinguished: non-preemptable, resumable and preemptable. An operation of a resumable job if not completed before a non-availability period of a machine may be suspended and continued without additional cost when the machine becomes available. In the...

On the application of insertion techniques for job shop problems with setup times

Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner (2010)

RAIRO - Operations Research

Similarity:

Constructive heuristics for shop scheduling problems are often based on priority (or dispatching) rules. However, recent work has demonstrated that insertion algorithms that step by step insert operations or jobs into partial schedules usually clearly outperform priority rules. In this paper, we consider various job shop scheduling problems with setup times. For each job a specific technological route and a release date are given. Moreover, the jobs are partitioned into groups. A sequence...