Parameterized complexity of machine scheduling: 15 open problems

Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions in this area whose resolution we expect to lead to the discovery of new approaches and techniques both in scheduling and parameterized complexity theory.Comment: Version accepted to Computers & Operations Researc

Shop scheduling with availability constraints

Scheduling Theory studies planning and timetabling of various industrial and human activities and, therefore, is of constant scientific interest. Being a branch of Operational Research, Theory of Scheduling mostly deals with problems of practical interest which can be easily (from a mathematical point of view) solved by full enumeration and at the same time usually require enormous time to be solved optimally. Therefore, one attempts to develop algorithms for finding optimal or near optimal solutions of the problems under consideration in reasonable time. If the output of an algorithm is not always an optimal solution then the worst-case analysis of this algorithm is undertaken in order to estimate either a relative error or an absolute error that holds for any given instance of the problem. Scheduling problems which are usually considered in the literature assume that the processing facilities are constantly available throughout the planning period. However, in practice, the processing facility, e.g. a machine, a labour, etc. can become non-available due to various reasons, e.g. breakdowns, lunch breaks, holidays, maintenance work, etc. All these facts stimulate research in the area of scheduling with non-availability constraints. This branch of Scheduling Theory has recently received a lot of attention and a considerable number of research papers have been published. This thesis is fully dedicated to scheduling with non-availability constraints under various assumptions on the structure of the processing system and on the types of non-availability intervals

Approximability of two-machine no-wait flowshop scheduling with availability constraints

2002-2003 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

A survey of scheduling problems with setup times or costs

Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

04231 Abstracts Collection -- Scheduling in Computer and Manufacturing Systems

During 31.05.-04.06.04, the Dagstuhl Seminar 04231 "Scheduling in Computer and Manufacturing Systems" was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Scheduling with processing set restrictions : a survey

2008-2009 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Heuristics Techniques for Scheduling Problems with Reducing Waiting Time Variance

In real computational world, scheduling is a decision making process. This is nothing but a systematic schedule through which a large numbers of tasks are assigned to the processors. Due to the resource limitation, creation of such schedule is a real challenge. This creates the interest of developing a qualitative scheduler for the processors. These processors are either single or parallel. One of the criteria for improving the efficiency of scheduler is waiting time variance (WTV). Minimizing the WTV of a task is a NP-hard problem. Achieving the quality of service (QoS) in a single or parallel processor by minimizing the WTV is a problem of task scheduling. To enhance the performance of a single or parallel processor, it is required to develop a stable and none overlap scheduler by minimizing WTV. An automated scheduler\u27s performance is always measured by the attributes of QoS. One of the attributes of QoS is ‘Timeliness’. First, this chapter presents the importance of heuristics with five heuristic-based solutions. Then applies these heuristics on 1‖WTV minimization problem and three heuristics with a unique task distribution mechanism on Qm|prec|WTV minimization problem. The experimental result shows the performance of heuristic in the form of graph for consonant problems