Skip navigation

Shop scheduling with availability constraints

Shop scheduling with availability constraints

Kubzin, Mikhail A. (2005) Shop scheduling with availability constraints. PhD thesis, University of Greenwich.

[img] PDF
Mikhail_Kubzin_2005.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (119MB)


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.

Item Type: Thesis (PhD)
Additional Information:
Uncontrolled Keywords: operational research, scheduling theory, non-availability constraints,
Subjects: H Social Sciences > HD Industries. Land use. Labor
Q Science > QA Mathematics
Pre-2014 Departments: School of Computing & Mathematical Sciences
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
Last Modified: 26 Aug 2018 16:42

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics