Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates

Date

1997-11-01

Author

Azizoğlu, Meral

Metadata

Show full item record

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

Item Usage Stats

178
views

0
downloads

We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due window to minimize total weighted earliness and tardiness cost. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. Earliness or tardiness cost is assessed when a job completes outside the due window, which may be an instant in time or a time increment defining acceptable job completion. In this paper we present properties that characterize the structure of an optimal schedule, present a lower bound, propose a two-step branch and bound algorithm, and report results from a computational experiment. We rnd that optimal solutions can be quickly obtained for medium-sized problem instances.

Subject Keywords

Industrial and Manufacturing Engineering

URI

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

Journal

IIE TRANSACTIONS

DOI

https://doi.org/10.1080/07408179708966418

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Scheduling job families about an unrestricted common due date on a single machine Azizoğlu, Meral (1997-01-01) We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due date to minimize total weighted earliness and tardiness cost. Jobs are grouped into families where jobs in the same family share a setup; a setup time is required between the processing of two jobs from different families. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. These rates are assessed on a per-period basis when the completion time deviates from its ...
Scheduling parallel machines to minimize weighted flowtime with family set-up times Azizoğlu, Meral (Informa UK Limited, 2003-01-01) We describe and evaluate several branch-and-bound algorithms for an identical parallel machine scheduling problem with family set-up times and an objective of minimizing total weighted flowtime. The algorithms differ by choice of lower bound method. Computational results suggest conditions favourable to a particular algorithm as well as the range of problem sizes that can be optimally solved in reasonable CPU time.
Parallel-machine rescheduling with machine disruptions Azizoğlu, Meral (Informa UK Limited, 2005-12-01) In this study we consider a rescheduling problem on identical parallel machines. The rescheduling is undertaken because of a period of unavailability on one of the machines. We consider the total flow time as an efficiency measure and stability is gauged in terms of the number of jobs processed on different machines in the original and new schedules. We show that all efficient schedules with respect to efficiency and stability measures can be generated in polynomial time.
Generating all efficient solutions of a rescheduling problem on unrelated parallel machines Ozlen, Melih; Azizoğlu, Meral (Informa UK Limited, 2009-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 stability measures. Our efficiency measure is the total flow time and stability measure is the total reassignment cost caused by the differences in the machine allocations in the initial and new schedules. We propose a branch and bound algorithm to generate all efficie...
Due date and cost-based FMS loading, scheduling and tool management Turkcan, Ayten; Akturk, M. Selim; Storer, Robert H. (Informa UK Limited, 2007-03-01) In this study, we consider flexible manufacturing system loading, scheduling and tool management problems simultaneously. Our aim is to determine relevant tool management decisions, which are machining conditions selection and tool allocation, and to load and schedule parts on non-identical parallel CNC machines. The dual objectives are minimization of the manufacturing cost and total weighted tardiness. The manufacturing cost is comprised of machining and tooling costs (which are affected by machining cond...

Citation Formats

M. Azizoğlu, “Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates,” IIE TRANSACTIONS, pp. 1001–1006, 1997, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47714.