6 research outputs found
A dynamic lot-sizing model with demand time windows
One of the basic assumptions of the classical dynamic lot-sizing model is that the aggregate demand of a given period must be satisfied in that period. Under this assumption, if backlogging is not allowed then the demand of a given period cannot be delivered earlier or later than the period. If backlogging is allowed, the demand of a given period cannot be delivered earlier than the period, but can be delivered later at the expense of a backordering cost. Like most mathematical models, the classical dynamic lot-sizing model is a simplified paraphrase of what might actually happen in real life. In most real life applications, the customer offers a grace period - we call it a demand time window - during which a particular demand can be satisfied with no penalty. That is, in association with each demand, the customer specifies an earliest and a latest delivery time. The time interval characterized by the earliest and latest delivery dates of a demand represents the corresponding time window. This paper studies the dynamic lot-sizing problem with demand time windows and provides polynomial time algorithms for computing its solution. If shortages are not allowed, the complexity of the proposed algorithm is of the order T square. When backlogging is allowed, the complexity of the proposed algorithm is of the order T cube.dynamic programming;lot-sizing;time windows
Hybrid Genetic Bees Algorithm applied to Single Machine Scheduling with Earliness and Tardiness Penalties
This paper presents a hybrid Genetic-Bees Algorithm based optimised solution for the single machine scheduling problem. The enhancement of the Bees Algorithm (BA) is conducted using the Genetic Algorithm's (GA's) operators during the global search stage. The proposed enhancement aims to increase the global search capability of the BA gradually with new additions. Although the BA has very successful implementations on various type of optimisation problems, it has found that the algorithm suffers from weak global search ability which increases the computational complexities on NP-hard type optimisation problems e.g. combinatorial/permutational type optimisation problems. This weakness occurs due to using a simple global random search operation during the search process. To reinforce the global search process in the BA, the proposed enhancement is utilised to increase exploration capability by expanding the number of fittest solutions through the genetical variations of promising solutions. The hybridisation process is realised by including two strategies into the basic BA, named as â\u80\u9creinforced global searchâ\u80\u9d and â\u80\u9cjumping functionâ\u80\u9d strategies. The reinforced global search strategy is the first stage of the hybridisation process and contains the mutation operator of the GA. The second strategy, jumping function strategy, consists of four GA operators as single point crossover, multipoint crossover, mutation and randomisation. To demonstrate the strength of the proposed solution, several experiments were carried out on 280 well-known single machine benchmark instances, and the results are presented by comparing to other well-known heuristic algorithms. According to the experiments, the proposed enhancements provides better capability to basic BA to jump from local minima, and GBA performed better compared to BA in terms of convergence and the quality of results. The convergence time reduced about 60% with about 30% better results for highly constrained jobs
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
[EN] In practice due dates usually behave more like intervals rather than specific points in time. This paper studies hybrid flowshops where jobs, if completed inside a due window, are considered on time. The objective is therefore the minimization of the weighted earliness and tardiness from the due window. This objective has seldom been studied and there are almost no previous works for hybrid flowshops. We present methods based on the simple concepts of iterated greedy and iterated local search. We introduce some novel operators and characteristics, like an optimal idle time insertion procedure and a two stage local search where, in the second stage, a limited local search on a exact representation is carried out. We also present a comprehensive computational campaign, including the reimplementation and comparison of 9 competing procedures. A thorough evaluation of all methods with more than 3000 instances shows that our presented approaches yield superior results which are also demonstrated to be statistically significant. Experiments also show the contribution of the new operators in the presented methods. (C) 2016 Elsevier Ltd. All rights reserved.The authors would like to thank Professors Lofti Hidri and Mohamed Haouari for sharing with us the source codes and explanations of the lower bounds. Quan-Ke Pan is supported by the National Natural Science Foundation of China (Grant No. 51575212), Program for New Century Excellent Talents in University (Grant No. NCET-13-0106), Science Foundation of Hubei Province in China (Grant No. 2015CFB560), Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20130042110035), Key Laboratory Basic Research Foundation of Education Department of Liaoning Province (LZ2014014), Open Research Fund Program of the State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, China. Ruben Ruiz and Pedro Alfaro-Fernandez are supported by the Spanish Ministry of Economy and Competitiveness, under the project "SCHEYARD Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R) financed by FEDER funds.Pan, Q.; Ruiz GarcĂa, R.; Alfaro-Fernandez, P. (2017). Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows. Computers & Operations Research. 80:50-60. https://doi.org/10.1016/j.cor.2016.11.022S50608
Single machine scheduling problems: early-tardy penalties
Ankara : The Department of Industrial Engineering and The Institute of Engineering and Science of Bilkent Univ., 1993.Thesis (Ph.D.) -- Bilkent University, 1993.Includes bibliographical references leaves 120-126.The primary concern of this dissertation is to analyze single machine total earliness
and tardiness scheduling problems with different due dates and to develop
both a dynamic programming formulation for its exact solution and heuristic
algorithms for its approximate solution within acceptable limits. The analyses of
previous works on the single machine earliness and tardiness scheduling problems
reveal that the research mainly focused on a restricted problem type in which
no idle time insertion is allowed in the schedule. This study deals with the
general case where idle time insertion is allowed whenever necessary. Even
though this problem is known to be A'P-hard in the ordinary sense, there is
still a need to develop an optimizing algorithm through dynamic programming
formulation. Development of such an algorithm is necessary for further identifying
an approximation scheme for the problem which is an untouched issue in the
earliness and tardiness scheduling theory. Furthermore, the developed dynamic
programming formulation is extended to an incomplete dynamic programming
which forms the core of one of the heuristic procedure proposed.A second aspect of this study is to investigate two special structures for the
different due dates, namely Equal-Slack and Total-Work-Content rules, and to
discuss computational complexity of the problem with these special structures.
Consequently, solution procedures which bear on the characteristics of the special
due date structures are proposed. This research shows that the total earliness
and tardiness scheduling problem with Equal-Slack rule is A/’P-hard but can be
solvable in polynomial time in certain cases. Moreover, a very efficient heuristic
algorithm is proposed for the problem with the other due date structure and the
results of this part leads to another heuristic algorithm for the general due date
structure.
Finally, a lower bound procedure is presented which is motivated from the
structure of the optimal solution of the problem. This lower bound is compared
with another lower bound from the literature and it is shown that it performs
well on randomly generated problems.Oguz, CeydaPh.D