Single facility sequencing with variable processing times and costs

DOI10.1080/09720510.1998.10700980zbMATH Open0922.90090OpenAlexW1973592509MaRDI QIDQ4239676FDOQ4239676

Authors: Kizhanatham V. Ramaswamy 

Publication date: 18 October 1999

Published in: Journal of Statistics and Management Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720510.1998.10700980

Recommendations

• Single-machine sequencing with controllable processing times
• scientific article; zbMATH DE number 4079152
• The Single Machine Problem with a Quadratic Cost Function of Completion Times
• A survey of results for sequencing problems with controllable processing times
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs

zbMATH Keywords

single facility job sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (4)

• The Single Machine Problem with a Quadratic Cost Function of Completion Times
• Sequencing to minimize the maximum renewal cumulative cost
• Title not available (Why is that?)
• A sequencing problem in the weaving industry

This page was built for publication: Single facility sequencing with variable processing times and costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4239676)