AN INTERACTIVE APPROACH FOR A DUAL CONSTRAINT JOB SHOP SCHEDULING PROBLEM

Date

1991-01-01

Author

KONDAKCI, S
GUPTA, RM

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

141
views

0
downloads

Until recently, heuristic dispatching rules were the only practical means to solve the job shop scheduling problem. Currently, a promising direction in job shop scheduling is interactive scheduling. In this study an interactive scheduling approach is developed for a dual-constraint dynamic job shop production environment. The approach is used by a number of subjects in an experiment. The performance of the subjects is compared with that of dispatching rules based on tardiness and other measures relevant to the job shop environment. The results indicate that the subjects outperform the dispatching rules in general.

Subject Keywords

General Engineering, General Computer Science

URI

https://hdl.handle.net/11511/65820

Journal

COMPUTERS & INDUSTRIAL ENGINEERING

DOI

https://doi.org/10.1016/0360-8352(91)90001-m

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Single machine scheduling with maximum earliness and number tardy Azizoğlu, Meral; Koksalan, M (Elsevier BV, 2003-08-01) In this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness while keeping the number of tardy jobs to its minimum value. We then propose a general procedure for <LF>generating all efficient schedules for bicriteria problems. We also develop a general procedure to find the efficient schedule that minimizes a composite fu...
A unifying grid approach for solving potential flows applicable to structured and unstructured grid configurations Cete, A. Ruhsen; Yuekselen, M. Adil; Kaynak, Uenver (Elsevier BV, 2008-01-01) In this study, an efficient numerical method is proposed for unifying the structured and unstructured grid approaches for solving the potential flows. The new method, named as the "alternating cell directions implicit - ACDI", solves for the structured and unstructured grid configurations equally well. The new method in effect applies a line implicit method similar to the Line Gauss Seidel scheme for complex unstructured grids including mixed type quadrilateral and triangle cells. To this end, designated al...
The dynamic p-median problem with mobile facilities Guden, Huseyin; Süral, Haldun (Elsevier BV, 2019-09-01) Being motivated by real life applications in construction management, we consider the dynamic p-median problem and its extension with mobile facilities. The number of facilities changes over a planning horizon where one or more facilities can be opened, relocated, or closed in any period. The problem is to determine (i) facility locations, (ii) opening/closing times of facilities, (iii) routes of mobile facilities, and (iv) demand allocations to open facilities such that the total cost is minimized. We pres...
Integrating estimation of distribution algorithms versus Q-learning into Meta-RaPS for solving the 0-1 multidimensional knapsack problem Arin, Arif; Rabadi, Ghaith (Elsevier BV, 2017-10-01) Finding near-optimal solutions in an acceptable amount of time is a challenge when developing sophisticated approximate approaches. A powerful answer to this challenge might be reached by incorporating intelligence into metaheuristics. We propose integrating two methods into Meta-RaPS (Metaheuristic for Randomized Priority Search), which is currently classified as a memoryless metaheuristic. The first method is the Estimation of Distribution Algorithms (EDA), and the second is utilizing a machine learning a...
A robust bi-objective mathematical model for disaster rescue units allocation and scheduling with learning effect Tirkolaee, Erfan Babaee; Aydin, Nadi Serhan; Ranjbar-Bourani, Mehdi; Weber, Gerhard Wilhelm (Elsevier BV, 2020-11-01) This paper proposes a novel bi-objective mixed-integer linear programming (MILP) model for allocating and scheduling disaster rescue units considering the learning effect. When a natural phenomenon (e.g., earthquake or flood) occurs, the presented decision support model is expected to help decision-makers of emergency relief centers to provide efficient planning for rescue units to minimize the total weighted completion time of rescue operations, as well as the total delay in rescue operations. The problem ...

Citation Formats

S. KONDAKCI and R. GUPTA, “AN INTERACTIVE APPROACH FOR A DUAL CONSTRAINT JOB SHOP SCHEDULING PROBLEM,” COMPUTERS & INDUSTRIAL ENGINEERING, pp. 293–302, 1991, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65820.