[PDF] Top 20 Study of Scheduling Problems with Machine Availability Constraint

... production scheduling, orders are fixed in terms of starting and finishing ...as machine unavailable periods for the new jobs to be ...This constraint may be relaxed by increasing the number of ... See full document

... to machine failure has been done with the reactive approach or in the reactive phase of the hybrid ...reactive scheduling methods ...big problems, it takes a long time to deal with the uncertain ... See full document

... The study of earliness and tardiness penalties in scheduling models is a relatively recent area of ...years, scheduling research focused on single perfor- mance measures, referred to as regular ... See full document

... or scheduling has been the purpose of numerous ...The scheduling problem for single machine has been addressed using both exact and heuristic ...a study by Chen et al. (2007), the makespan of ... See full document

... a machine (hole) and then to complete its execution after the hole, possibly with a penalty proportional to the already executed ...crossable availability periods the ones that allow jobs to be ...the ... See full document

... the scheduling of workforce with ‘flexible’ arrangements and ‘mobility’ is of great importance in many ...personnel scheduling problems have been tackled in the literature (Baker, 1976; Miller, 1976; ... See full document

... parallel machine scheduling can be categorized into three types: identical, uniform and unrelated parallel machine scheduling problems (Cheng & Sin, ...unrelated machine ... See full document

... shop scheduling problems have been subject to intensive research due to their multiple ...shop scheduling is known as a strongly NP- complete ...shop scheduling problems, processing ... See full document

... Inderfurth et al. [3] studied the problem of scheduling the production of main and defective items of a product for the same facility. The objective is to nd batch sizes and positions of items to be reworked so ... See full document

... A new genetic algorithm was developed. It is based on the concept of dynamic programming where the population size and the chromosome of the solution are increased as the iteration number increases. The computational ... See full document

... activity constraint with the activity that immediately follows in the original Solomon’s ...activity constraint, then we must choose between one of the 5 different ...overlapping constraint for two ... See full document

... Gupta and Sharma [84] introduced a SDST-MOHFSP to minimize the rental cost of machines with minimum makespan. Johnson algorithm [102] was used and a simple constructive heuristic algorithm was proposed. Wang et al. [229] ... See full document

... of constraint programming (CP) formulations of the deterministic version of this problem, using the Odette Cancer Centre as a case ...solve problems of the required ... See full document

... solve problems up to 110 jobs combined with 10 machines without considering the constraint that each operation can be processed on at most one machine at a ...this constraint, a time consuming ... See full document

... Hard constraint one (1) states that a doctor is only allowed to work a single shift in a ...the constraint is violated to find a scheduling ... See full document

... This T-CBR solution is 365 units in length. The SA algorithm produced a solution of 338 units. This T-CBR solution is 8% longer than the SA solution. This adaptation mechanism is inspired by the geometric techniques for ... See full document

... The rest of this paper is organized as follows. The problem under study is illustrated in Section 2. The optimal (polynomial-time) solution is presented in Section 3. A numerical example to demonstrate the ... See full document

... to study the properties of combinatorial problems (Mitchell et ...combinatorial problems, which decompose to pairwise (or higher order) interactions, allowing for a graphical representation in the ... See full document

... Boolean constraint satisfaction problem (CSP) is called approximation re- sistant if independently setting variables to 1 with some probability α achieves the best possible approximation ratio for the fraction of ... See full document

... planning problems based on STRIPS, where actions have instantaneous ...practical problems mainly due to its propositional nature and lack of support for modeling different kind of resources and different ... See full document