JOB-SHOP SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT

Date

1994-08-01

Author

TOKER, A
KONDAKCI, S
ERKIP, N

Metadata

Show full item record

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

Item Usage Stats

187
views

0
downloads

In this paper we consider the job shop scheduling problem under a discrete non-renewable resource constraint. We assume that jobs have arbitrary processing times and resource requirements and there is a unit supply of the resource at each time period. We develop an approximation algorithm for this problem and empirically test its effectiveness in finding the minimum makespan schedules.

Subject Keywords

Marketing, Management Science and Operations Research, Strategy and Management, Management Information Systems

URI

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

Journal

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

DOI

https://doi.org/10.2307/2584018

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria Ozlen, M.; Azizoğlu, Meral (Informa UK Limited, 2011-01-01) In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and the schedule deviation measures. The efficiency measure is the total flow time, and the schedule deviation measure is the total disruption cost caused by the differences between the initial and current schedules. We provide polynomial-time solution methods to the follo...
SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT TOKER, A; KONDAKCI, S; ERKIP, N (Informa UK Limited, 1991-09-01) This paper examines a single-machine, non-renewable-resource-constrained scheduling problem where jobs have arbitary processing times and resource requirements. Unit supply of a resource is assumed at each time period. Performance criterion is makespan. It is proved that this problem is identical to the two-machine flowshop problem, enabling the use of Johnson's algorithm. Immediate extensions of this result are presented.
Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic ÇELİK, MELİH; Süral, Haldun (Informa UK Limited, 2019-02-01) In this paper, we consider the order picking problem (OPP), which constitutes one of the special cases of the Steiner travelling salesperson problem and addresses the costliest operation in a warehouse. Given a list of items to be picked and their locations in the warehouse layout, the OPP aims to find the shortest route that starts from a depot point, picks all the items in the list, and returns to the depot. This paper fills two important gaps regarding the OPP. First, to the best of our knowledge, we pre...
Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm Solyali, O.; Ozpeynirci, O. (Informa UK Limited, 2009-01-01) This study addresses the operational fixed job scheduling problem under spread time constraints. The problem is to select a subset of jobs having fixed ready times and deadlines for processing on identical parallel machines such that total weight of the selected jobs is maximised. We first give a mathematical formulation of the problem and then reformulate it using Dantzig-Wolfe decomposition. We propose a branch-and-price algorithm that works on the reformulation of the problem. Computational results show ...
Bank asset and liability management under uncertainty Oguzsoy, CB; Güven, Sibel (Elsevier BV, 1997-11-01) This study presents a multiperiod stochastic linear simple recourse model for asset and liability management in banking. The model determines the portfolio of assets and liabilities over the planning horizon given a set of deterministic rates of returns of investments and costs of borrowings, and a set of random outstanding deposit levels, liquidity and total reserve requirements with a given discrete probability distribution. The intention is to develop an optimization tool to assure sustained profitabilit...

Citation Formats

A. TOKER, S. KONDAKCI, and N. ERKIP, “JOB-SHOP SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT,” JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, pp. 942–947, 1994, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/67324.