Back to Search
Start Over
Optimal constant due-date determination and sequencing of n jobs on a single machine
- Source :
- International Journal of Production Economics. 22:259-261
- Publication Year :
- 1991
- Publisher :
- Elsevier BV, 1991.
-
Abstract
- This paper considers due-date determination and sequencing of n jobs on a single-machine where each job is given a constant flow allowance. The objective is to determine the optimal value of the flow allowance and the optimal job sequence to minimize a cost function based on the flow allowance and the job earliness and tardiness values. We first propose a linear programming (LP) formulation of the problem and then derive the optimal constant flow allowance via considering the LP dual problem. We show that the optimal constant due-date value is independent of job sequence. After the theoretical treatment, a numerical example is presented for discussion.
- Subjects :
- Economics and Econometrics
Sequence
Mathematical optimization
Linear programming
Tardiness
Value (computer science)
Allowance (engineering)
Function (mathematics)
Management Science and Operations Research
General Business, Management and Accounting
Industrial and Manufacturing Engineering
Flow (mathematics)
Optimal constant
Computer Science::Operating Systems
Computer Science::Distributed, Parallel, and Cluster Computing
Mathematics
Subjects
Details
- ISSN :
- 09255273
- Volume :
- 22
- Database :
- OpenAIRE
- Journal :
- International Journal of Production Economics
- Accession number :
- edsair.doi...........c2bc76c631f3b013692b55a65a342566
- Full Text :
- https://doi.org/10.1016/0925-5273(91)90101-x