The robust single machine scheduling problem with uncertain release and processing times

In this work, we study the single machine scheduling problem with uncertain release times and processing times of jobs. We adopt a robust scheduling approach, in which the measure of robustness to be minimized for a given sequence of jobs is the worst-case objective function value from the set of all possible realizations of release and processing times. The objective function value is the total flow time of all jobs. We discuss some important properties of robust schedules for zero and non-zero release times, and illustrate the added complexity in robust scheduling given non-zero release times. We propose heuristics based on variable neighborhood search and iterated local search to solve the problem and generate robust schedules. The algorithms are tested and their solution performance is compared with optimal solutions or lower bounds through numerical experiments based on synthetic data

Minimizing Total Weighted Completion Time on Single Machine with Past-Sequence-Dependent Setup Times and Exponential Time-Dependent and Position-Dependent Learning Effects

This paper addresses a single-machine problem in which the past-sequence-dependent (p-s-d) setup times and exponential time-dependent and position-dependent learning effects are considered. By the exponential time-dependent learning effect, it means that the processing time of a job is defined by an exponent function of the total actual processing time of the already processed jobs. The setup times are proportional to the length of the already processed jobs. The aim is to minimize the total weighted completion time, this is an NP-hard problem. Under certain conditions, it is shown that the classical WSPT rule is optimal for the problem

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

Order Acceptance and Scheduling: A Taxonomy and Review

Over the past 20 years, the topic of order acceptance has attracted considerable attention from those who study scheduling and those who practice it. In a firm that strives to align its functions so that profit is maximized, the coordination of capacity with demand may require that business sometimes be turned away. In particular, there is a trade-off between the revenue brought in by a particular order, and all of its associated costs of processing. The present study focuses on the body of research that approaches this trade-off by considering two decisions: which orders to accept for processing, and how to schedule them. This paper presents a taxonomy and a review of this literature, catalogs its contributions and suggests opportunities for future research in this area

An estimation of distribution algorithm for lot-streaming flow shop problems with setup times

Lot-streaming flow shops have important applications in different industries including textile, plastic, chemical, semiconductor and many others. This paper considers an n-job m-machine lot-streaming flow shop scheduling problem with sequence-dependent setup times under both the idling and noidling production cases. The objective is to minimize the maximum completion time or makespan. To solve this important practical problem, a novel estimation of distribution algorithm (EDA) is proposed with a job permutation based representation. In the proposed EDA, an efficient initialization scheme based on the NEH heuristic is presented to construct an initial population with a certain level of quality and diversity. An estimation of a probabilistic model is constructed to direct the algorithm search towards good solutions by taking into account both job permutation and similar blocks of jobs. A simple but effective local search is added to enhance the intensification capability. A diversity controlling mechanism is applied to maintain the diversity of the population. In addition, a speed-up method is presented to reduce the computational effort needed for the local search technique and the NEH-based heuristics. A comparative evaluation is carried out with the best performing algorithms from the literature. The results show that the proposed EDA is very effective in comparison after comprehensive computational and statistical analyses.This research is partially supported by the National Science Foundation of China (60874075, 70871065), and Science Foundation of Shandong Province in China under Grant BS2010DX005, and Postdoctoral Science Foundation of China under Grant 20100480897. Ruben Ruiz is partially funded by the Spanish Ministry of Science and Innovation, under the project "SMPA-Advanced Parallel Multiobjective Sequencing: Practical and Theoretical Advances" with reference DPI2008-03511/DPI and by the IMPIVA-Institute for the Small and Medium Valencian Enterprise, for the project OSC with references IMIDIC/2008/137, IMIDIC/2009/198 and IMIDIC/2010/175.Pan, Q.; Ruiz García, R. (2012). An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega. 40(2):166-180. https://doi.org/10.1016/j.omega.2011.05.002S16618040

Production planning mechanisms in demand-driven wood remanufacturing industry

L'objectif principal de cette thèse est d'étudier le problème de planification de la production dans le contexte d'une demande incertaine, d’un niveau de service variable et d’approvisionnements incontrôlables dans une usine de seconde transformation du bois. Les activités de planification et de contrôle de production sont des tâches intrinsèquement complexes et difficiles pour les entreprises de seconde transformation du bois. La complexité vient de certaines caractéristiques intrinsèques de cette industrie, comme la co-production, les procédés alternatifs divergents, les systèmes de production sur commande (make-to-order), des temps de setup variables et une offre incontrôlable. La première partie de cette thèse propose une plate-forme d'optimisation/simulation permettant de prendre des décisions concernant le choix d'une politique de planification de la production, pour traiter rapidement les demandes incertaines, tout en tenant compte des caractéristiques complexes de l'industrie de la seconde transformation du bois. À cet effet, une stratégie de re-planification périodique basée sur un horizon roulant est utilisée et validée par un modèle de simulation utilisant des données réelles provenant d'un partenaire industriel. Dans la deuxième partie de cette thèse, une méthode de gestion des stocks de sécurité dynamique est proposée afin de mieux gérer le niveau de service, qui est contraint par une capacité de production limitée et à la complexité de la gestion des temps de mise en course. Nous avons ainsi développé une approche de re-planification périodique à deux phases, dans laquelle des capacités non-utilisées (dans la première phase) sont attribuées (dans la seconde phase) afin de produire certains produits jugés importants, augmentant ainsi la capacité du système à atteindre le niveau de stock de sécurité. Enfin, dans la troisième partie de la thèse, nous étudions l’impact d’un approvisionnement incontrôlable sur la planification de la production. Différents scénarios d'approvisionnement servent à identifier les seuils critiques dans les variations de l’offre. Le cadre proposé permet aux gestionnaires de comprendre l'impact de politiques d'approvisionnement proposées pour faire face aux incertitudes. Les résultats obtenus à travers les études de cas considérés montrent que les nouvelles approches proposées dans cette thèse constituent des outils pratiques et efficaces pour la planification de production du bois.The main objective of this thesis is to investigate the production planning problem in the context of uncertain demand, variable service level, and uncontrollable supply in a wood remanufacturing mill. Production planning and control activities are complex and represent difficult tasks for wood remanufacturers. The complexity comes from inherent characteristics of the industry such as divergent co-production, alternative processes, make-to-order, short customer lead times, variable setup time, and uncontrollable supply. The first part of this thesis proposes an optimization/simulation platform to make decisions about the selection of a production planning policy to deal swiftly with uncertain demands, under the complex characteristics of the wood remanufacturing industry. For this purpose, a periodic re-planning strategy based on a rolling horizon was used and validated through a simulation model using real data from an industrial partner. The computational results highlighted the significance of using the re-planning model as a practical tool for production planning under unstable demands. In the second part, a dynamic safety stock method was proposed to better manage service level, which was threatened by issues related to limited production capacity and the complexity of setup time. We developed a two-phase periodic re-planning approach whereby idle capacities were allocated to produce more important products thus increasing the realization of safety stock level. Numerical results indicated that the solution of the two-phase method was superior to the initial method in terms of backorder level as well as inventory level. Finally, we studied the impact of uncontrollable supply on demand-driven wood remanufacturing production planning through an optimization and simulation framework. Different supply scenarios were used to identify the safety threshold of supply changes. The proposed framework provided managers with a novel advanced planning approach that allowed understanding the impact of supply policies to deal with uncertainties. In general, the wood products industry offers a rich environment for dealing with uncertainties for which the literature fails to provide efficient solutions. Regarding the results that were obtained through the case studies, we believe that approaches proposed in this thesis can be considered as novel and practical tools for wood remanufacturing production planning