Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems
Date
2001-05-16
Author
Korkmazel, T
Meral, S
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
189
views
0
downloads
Cite This
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 goal 2 are analyzed through minimizing the sum-of-deviations of actual production from the desired amount. The approaches that are found to be performing better than the others are extended for the bicriteria problem considering goals 1 and 2, simultaneously. It is also shown that the bicriteria problem with the sum-of-deviations type objective function can also be formulated as an assignment problem, and the optimal solution to the small-sized problems can thus be obtained by solving the assignment problem. Finally, the conditions when it is important to take the workload-smoothing goal into consideration are analyzed.
Subject Keywords
Production
,
Scheduling
,
Just-in-time
,
Mixed-model assembly lines
,
Sequencing
URI
https://hdl.handle.net/11511/64902
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
DOI
https://doi.org/10.1016/s0377-2217(00)00061-8
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
Parallel production lines with sequence-dependent setup times and side constraints
Sargut, Zeynep; Azizoğlu, Meral (TMMOB Makina Mühendisleri Odası, 2017-01-01)
Stochastic assembly line balancing problems involving robots and reliability restriction
Şahin, Muhammet Ceyhan; Tural, Mustafa Kemal; Department of Industrial Engineering (2022-7-1)
When considering assembly processes in the manufacturing ecosystem, the task times may vary from cycle to cycle, especially in assembly lines where manual operations are abundant. Line stops, defective products, and off-line tasks caused by the uncertainty in assembly processes can be highly costly for companies. Stochastic assembly line balancing problems (SALBPs) consider the task processing times as random variables to deal with uncertainty in real-life assembly operations. The difficulties faced due to...
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...
Order-Preserving Languages for the Supervisory Control of Automated Manufacturing Systems
Nooruldeen, Anas; Schmidt, Klaus Verner (Institute of Electrical and Electronics Engineers (IEEE), 2020-01-01)
Automated manufacturing systems (AMSs) consist of computer-controlled interconnected manufacturing components (MCs) that are used to transport and process different product types. Each product type requires a certain sequence of processing steps in different MCs. Hereby, multiple product types can share processing steps on the same MC and the paths of different products types can overlap. In this paper we consider the modeling of AMSs in the scope of supervisory control for discrete event systems (DES). On ...
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...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
T. Korkmazel and S. Meral, “Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems,”
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
, pp. 188–207, 2001, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64902.