The selection and scheduling of textile orders with due dates

Helman I. Stern, Zion Avivi

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

This paper describes a case study of a textile firm. The problem was reduced to a 0-1 integer program which selects the best subset of orders that maximizes revenue while meeting due dates (a problem that is NP-hard). Because of the limited technical competence of the firm's employees a 'best of three heuristic' solution procedure was proffered. Each of the heuristics are greedy with polynomial complexity of O(n2) where n is the number of possible orders available for selection. These algorithms were tested using real problem data and gave results of 4.5 (on average) percent error of maximum revenue. This was within the five percent limit specified by the firm. Initial successful implementation followed by disbandonment due to economic downturn displays the need for more strategic approaches to abet the implementation of operations research methodologies.

Original languageEnglish
Pages (from-to)11-16
Number of pages6
JournalEuropean Journal of Operational Research
Volume44
Issue number1
DOIs
StatePublished - 5 Jan 1990

Keywords

  • Job scheduling
  • greedy heuristics
  • integer programming
  • job selection
  • textile production

ASJC Scopus subject areas

  • Computer Science (all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'The selection and scheduling of textile orders with due dates'. Together they form a unique fingerprint.

Cite this