Parallel production lines with sequence-dependent setup times and side constraints

2017-01-01
Sargut, Zeynep
Azizoğlu, Meral
Show full item record
175
views
0
downloads
Scheduling, Sequence-dependent setup times, Heuristic, Integer programming, Çizelgeleme, Dizi bağımlı kurulum zamanları, Sezgisel, Tam sayılı programlama
https://hdl.handle.net/11511/87641
https://dergipark.org.tr/en/download/article-file/751271
Endüstri Mühendisliği Dergisi
Department of Industrial Engineering, Article

Suggestions

Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems
Korkmazel, T; Meral, S (2001-05-16)
A mixed-model manufacturing facility operating in a pull production environment can be controlled by setting a production schedule only for the last process in the facility which is usually an assembly line of mixed-model type. In the mixed-model sequencing problems, two major goals are considered: (1) smoothing the workload on each workstation on the assembly line, and (2) keeping a constant rate of usage of all parts used on the assembly line. In this study, first, some well-known solution approaches with...
Resource Constrained Multi-project Scheduling: Application in Software Company
Kurt, Pelin Akyil; KEÇECİ, BARIŞ (2019-01-01)
Project scheduling is a common problem of today's companies, which have project type production system. Project scheduling is a mechanism to communicate what tasks need to get done and which organizational resources will be allocated to complete those tasks in what timeframe. In this study, it is aimed to find the shortest completion time of projects and the starting/ending time of each activity as well in a software company, which is running simultaneous projects including multiple activities with predeces...
Scheduling a batch processing machine with non-identical job sizes
Azizoğlu, Meral (2000-07-10)
The problem of scheduling batch processors is important in some industries and, at a more fundamental level, captures an element of complexity common to many practical scheduling problems. We describe a branch and bound procedure applicable to a batch processor model with arbitrary job processing times, job weights and job sizes. The scheduling objective is to minimize total weighted completion time. We find that the procedure returns optimal solutions to problems of up to similar to 25 jobs in reasonable C...
Hybrid meta-heuristic algorithms for the resource constrained multi-project scheduling problem
Uysal, Furkan; Sönmez, Rifat; Department of Civil Engineering (2014)
The general resource constrained multi-project scheduling problem (RCMPSP) consists of simultaneous scheduling of two or more projects with common resource constraints, while minimizing duration of the projects. Critical Path Method and other scheduling methods do not consider resource conflicts and practically used commercial project management software packages and heuristic methods provide very limited solutions for the solution of the RCMPSP. Considering the practical importance of multi-project schedul...
Dynamic programming algorithms for scheduling parallel machines with family setup times
Webster, Scott; Azizoğlu, Meral (Elsevier BV, 2001-2)
We address the problem of scheduling jobs with family setup times on identical parallel machines to minimize total weighted flowtime. We present two dynamic programming algorithms - a backward algorithm and a forward algorithm - and we identify characteristics of problems where each algorithm is best suited. We also derive two properties that improve the computational efficiency of the algorithms. Scope and purpose While most production schedulers must balance conflicting goals of high system efficiency and...
Citation Formats
Z. Sargut and M. Azizoğlu, “Parallel production lines with sequence-dependent setup times and side constraints,” Endüstri Mühendisliği Dergisi, pp. 7–22, 2017, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/87641.
METU IIS - Integrated Information Service open@metu.edu.tr