Single machine scheduling to minimize batch delivery and job earliness penalties

Version of RecordPublishe

Production scheduling with supply and delivery considerations to minimize the makespan

Author name used in this publication: T. C. E. Cheng2008-2009 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

The single machine serial batch production scheduling with outsourcing allowed

Razmatramo nekoliko problema planiranja proizvodnje u serijama s dopuštenom mogućnošću ugovaranja proizvodnje s vanjskim proizvođačem (outsourcing). Postoji mogućnost da se svaki posao obavi na vlastitom stroju ili se ugovori s drugim poduzećem. Cilj je smanjiti ponderirani iznos cijene planirane proizvodnje i ukupne cijene outsourcinga. Razmatramo tri klasične objektivne funkcije programiranja. Prva je ukupno vrijeme izvršenja, druga je maksimalno kašnjenje, a treća je ponderirani broj kasnih poslova. Za svaki problem izvodima učinkovit dinamički algoritam programiranja koji minimalizira ukupni trošak.We consider several serial batch scheduling problems with outsourcing allowed. Each job can be either processed on the in-house machine or outsourced. The objective is to minimize the weighted sum of the scheduling cost and the total outsourcing cost. We discuss three classical scheduling objective functions. The first is the total completion time, the second is the maximum lateness, and the third is the weighted number of late jobs. For each problem, we derive an efficient dynamic programming algorithm that minimizes the total cost

ПОСТРОЕНИЕ РАСПИСАНИЙ ДЛЯ ОДНОСТАДИЙНЫХ СИСТЕМ ОБСЛУЖИВАНИЯ

Приведен обзор результатов, полученных в лаборатории математической кибернетики ОИПИ НАН наук Беларуси по решению задач теории расписаний для одностадийных детерминированных систем обслуживания

Integrated scheduling of production and logistics operations of a multi-plant manifacturer serving a single customer area

Ankara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2009.Thesis (Master's) -- Bilkent University, 2009.Includes bibliographical references leaves 129-132.Increasing market competition forces manufacturers to continuously reduce their leadtimes by minimizing the total time spent in both production and distribution. Some studies in the relevant literature indicate that scheduling production and logistics operations in a coordinated manner leads to improved results. This thesis studies the problem of scheduling production and distribution operations of a manufacturer serving a single customer area from multiple identical production plants dispersed at different geographical locations. The products are transported to the customer area by a single capacitated truck. The setting is inspired by the operations of a leading soft drink manufacturer, and the objective is set in line with their needs as the minimization of the total completion time of the jobs. The completion time of a job is defined as the time it reaches at the customer area. We consider both this general problem and four special cases motivated by common practical applications. We prove that both the main problem and three of its special cases are NP-hard at least in the ordinary sense. We develop mixed integer programming (MIP) models for all these problems and propose a pseudo-polynomial dynamic programming mechanism for the remaining special case. Since the MIP models are able to provide optimal solutions only for small instances in a reasonable amount of time, heuristics are also proposed to solve larger instances. Fast lower bounds are developed to facilitate the performance assessment of these heuristics in medium and large instances. Evidence from extensive computational experimentation suggests that the proposed heuristics are both efficient and effective.Çelen, MerveM.S