The selection and scheduling of textile orders with due dates

DOI10.1016/0377-2217(90)90309-YzbMath0687.90047OpenAlexW2080640932MaRDI QIDQ1263516

Zion Avivi, Jelman I. Stern

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90309-y

zbMATH Keywords

jobheuristicsselectionNP-hardpolynomial complexitycase studyjob schedulingtextile productiongreedy heuristics0-1 integer program

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (2)

Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline ⋮ A note on sequencing jobs with deadlines problem

Cites Work

• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• Preemptive Scheduling with Due Dates
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: The selection and scheduling of textile orders with due dates