Book•
Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
24 Mar 1982-
TL;DR: In this article, an introduction to the mathematics of the job shop is presented, with a focus on the sequential and scheduling aspects of the system. But this approach is not suitable for all job-shop scenarios.
Abstract: (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Journal of the Operational Research Society: Vol. 33, No. 9, pp. 862-862.
Citations
More filters
Journal Article•
TL;DR: Comparative simulation results of MCB with best effort scheduling policy on an overload situation show that MCB is an optimal scheduling policy.
Abstract: This paper presents an empirical study of non-preemptive Multicriteria-Based, called MCB for short, scheduling policy. MCB scheduling policy uses multiple criteria of each request: arrival time, deadline, and processing time, to balance the requirements on both client and server sites. Weighted aggregation method is applied in this study to conduct the different measurements to a single figure of merit. For the empirical study, an M/G/1 queuing simulation system is implemented with MATLAB to represent a general server's incoming request scheduling system. Comparative simulation results of MCB with best effort scheduling policy on an overload situation show that MCB is an optimal scheduling policy.
Cites background from "Sequencing and Scheduling: An Intro..."
...As summarized from [12, 13], first, FIFO policy intends to prioritize account by using the request’s arrival time....
[...]
Dissertation•
11 Nov 2013
TL;DR: In this article, a study of the production distribution problem is presented, in which synchronisierte Strategien entwickelt werden konnen, weniger bedeutend folgen danach jeweils the Transport-and Lagerkosten.
Abstract: Die wichtigsten Kostenfaktoren innerhalb einer Lieferkette lassen sich drei Kategorien zuordnen: Produktions-, Transport-und Lagerkosten. Die Strukturen dieser operativen Kosten im Hinblick auf die Gesamtkosten variieren stark je nach Industriesektor. Produktionskosten stellen dennoch die hochste Kostenart in fast allen Branchen dar, weniger bedeutend folgen danach jeweils die Transport- und Lagerkosten. Die Optimierung einer dieser Kategorien ohne Rucksicht auf die anderen kann zur Erhohung der Gesamtkosten sowie der allgemeinen Leistungsfahigkeit fuhren.
Diese Dissertation befasst sich mit dem „production distribution problem“ wobei synchronisierte Strategien entwickelt werden konnen, um die Leistung der Supply Chain zu verbessern und gleichzeitig die Gesamtkosten zu minimieren. Dazu wurde eine Fallstudie aus der Realitat untersucht, namlich das Praxisbeispiel eines Herstellers von Waschmitteln.
Zwei Hauptszenarien werden bewertet. Das erste Szenario ist der konventionelle Plan, wobei die Hersteller dominieren. Dies bedeutet, dass der Hersteller findet seinen eigenen optimalen Job-Scheduling-Plan, wahrend die Distribution versucht mit Hilfe dessen ihren optimalen Plan zu finden. Dadurch erhohen sich die Distributionskosten. Das zweite Szenario betrifft die Synchronisation der Produktions-, Lagerhaltungs- und Transportzeitplane.
Ein zu diesem Zweck entwickeltes Java-Programm und die Job-Scheduling-Software Simal wurden fur die Modellierung der konventionellen und integrierten Szenarien verwendet. Beide Szenarien wurden verglichen und validiert. Die Fallstudie betrachtet mehrere Produkte sowie ein schwer zu planendes flowshop- System. Die Ergebnisse zeigen, dass die Gesamtkosten, einschlieslich der Einrichtungs-, Lager- und Transportkosten, minimiert werden konnen, wenn das synchronisierte System angewendet wird.
Proceedings Article•
01 Jan 1994
TL;DR: In this article, the authors describe a framework for item-tive schedule revision based on acqutsition and reuse of user optimization preferences to improve schedule quality, which is implemented in CABINS.
Abstract: We describe a framework, implemented in CABINS, for itemtive schedule revision based on acqutsition and reuse of user optimization preferences to improve schedule quality. Practical scheduling problems generally require allocation of resources in the presence of a large, diverse and typically conflicting set of constraints and optimization criteria. The allstructuredness of both the solution space and the desired objectives make scheduling problems dificult to formalize. In CABINS, case-based reasoning is used for eliciting situation-dependent user’s tradeofls about repair actions and schedule quality to guide schedule revision for quality improvement. During iterative repair, cases are exploited for multiple purposes, such as (I) repair action selection, (2) evaluation of intermediate repair results and (3) recovery from revision failures. The contributions of the work lie in experimentally demonstrating an a domain when neither the user nor the program possess causal knowledge of the domain that taking into consideration failure information improves the efficiency of rather costly iterative repaar process. The experiments in this paper were performed an the context of job shop scheduling problems.
Dissertation•
01 Jan 2013
TL;DR: This research deals with the optimization of metrology and calibration problems and develops two methods to assess the AOQ of a calibration facility that uses a certain multistage inspection policy.
Abstract: This research deals with the optimization of metrology and calibration problems. The optimization involved here is the application scientifically sound operations research techniques to help in solving the problem intended optimally or semi-optimally with a practical time frame. The research starts by exploring the subject of measurement science known as metrology. This involves defining all the constituents of metrology facilities along with their various components. The definitions include the SI units’ history and structure as well as their characteristics. After that, a comprehensive description of most of the operations and parameters encountered in metrology is presented. This involves all sources of uncertainties in most of the parameters that affect the measurements. From the background presented and using all the information within it; an identification of the most important and critical general problems is attempted. In this treatment a number of potential optimization problems are identified along with their description, problem statement definition, impact on the system and possible treatment method. After that, a detailed treatment of the scheduling problem, the calibration interval determination problem and the average outgoing quality problem is presented. The scheduling problem is formulated and modelled as a mixed integer program then solved using LINGO program. A heuristic algorithm is then developed to solve the problem near optimally but in much quicker time, and solution is packaged in a computer program. The calibration interval problem treatment deals with the determination of the optimal CI. Four methods are developed to deal with different cases. The cases considered are the reliability target case, the CI with call cost and failure cost of both first failure and all failures and the case of large number of similar TMDEs. The average out going quality (AOQ) treatment involves the development two methods to assess the AOQ of a calibration facility that uses a certain multistage inspection policy. The two methods are mathematically derived and verified using a simulation model that compares them with an actual failure rate of a virtual calibration facility.
26 Apr 2007
TL;DR: Experimental results show that the proposed Web Service based method to conduct parallelized operations in an algorithm on multiple computers can substantially increase efficiency.
Abstract: In this paper, a Web Service based method is presented to conduct parallelized operations in an algorithm on multiple computers. Parallelizable operations in a constructive heuristic for flow shop scheduling problem with total flowtime minimization are analyzed. A parallel heuristic for the problem is described and its parameters are analyzed in theory. The proposed parallel heuristic is compared with the corresponding centralized one. Experimental results show that the proposed method can substantially increase efficiency.
Cites background from "Sequencing and Scheduling: An Intro..."
...Total flowtime is an important performance measure which is known to lead to stable or uniform utilization of resources, rapid turn-around of jobs and minimization of in-process inventory [5] [6]....
[...]