Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal total-work-content-power due-date determination and sequencing

From MaRDI portal
Publication:1097161
Jump to:navigation, search

DOI10.1016/0898-1221(87)90184-2zbMath0634.90028OpenAlexW1965688964MaRDI QIDQ1097161

Cheng, T. C. Edwin

Publication date: 1987

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(87)90184-2

zbMATH Keywords

earlinesssingle machinesequencingtardinessdue-date assignment


Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)


Related Items

Survey of scheduling research involving due date determination decisions, Scheduling job classes on uniform machines, A simpler and faster algorithm for optimal total-work-content-power due data determination



Cites Work

  • Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
  • Optimal due-date assignment in a job shop†
  • Simulation study of job shop scheduling with due dates
  • Due Date Assignment for Production Systems
  • Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1097161&oldid=13129813"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki