Minimizing the Range of Lateness on a Single Machine

1 September 1984

journal article
Published by Taylor & Francis in Journal of the Operational Research Society

Vol. 35 (9) , 853-857
https://doi.org/10.1057/jors.1984.168

Abstract

This paper gives an optimizing algorithm to minimize the range of lateness, that is the difference between the maximum and minimum lateness, of jobs in a single-machine sequencing problem. The procedure is based on a branch-and-bound technique. One example has been solved to illustrate the method.

Keywords

LOGISTICS
FORECASTING
COMMUNICATIONS TECHNOLOGY
INFORMATION TECHNOLOGY
PROJECT MANAGEMENT
MANAGEMENT SCIENCE
PRODUCTION
SCHEDULING
OPERATIONS RESEARCH
INFORMATION SYSTEMS
INVESTMENT
LOCATION
INVENTORY
OPERATIONAL RESEARCH
RELIABILITY
COMPUTER SCIENCE
MARKETING

This publication has 0 references indexed in Scilit: