Advanced search
Publication Cover
International Journal of Production Research Volume 26, 1988 - Issue 4
Submit an article Journal homepage
26
Views
35
CrossRef citations to date
0
Altmetric
Original Articles

Determination of an optimal common due date and optimal sequence in a single machine job shop

C. R. BECTOR Department of Actuarial and Management Sciences, The University of Manitoba, Winnipeg, Manitoba, R3T 2N2, Canada
,
Y. P. GUPTA Department of Actuarial and Management Sciences, The University of Manitoba, Winnipeg, Manitoba, R3T 2N2, Canada
&
M. C. GUPTA Department of Actuarial and Management Sciences, The University of Manitoba, Winnipeg, Manitoba, R3T 2N2, Canada
Pages 613-628 | Received 01 Mar 1987, Published online: 07 May 2007

Citations (35)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (3)

Swapnil Bhalla, Erlend Alfnes & Hans-Henrik Hvolby. (2023) Tools and practices for tactical delivery date setting in engineer-to-order environments: a systematic literature review. International Journal of Production Research 61:7, pages 2339-2371.
Read now
Jun-Gyu Kim, Ji-Su Kim & Dong-Ho Lee. (2012) Fast and meta-heuristics for common due-date assignment and scheduling on parallel machines. International Journal of Production Research 50:20, pages 6040-6057.
Read now
Jenhung Wang & Pei-Chun Lin. (2007) Minimization of total absolute deviation for a common due date. Journal of Information and Optimization Sciences 28:6, pages 869-880.
Read now

Articles from other publishers (32)

Gustavo Alencar Rolim & Marcelo Seido Nagano. (2020) Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review. Computers & Industrial Engineering 149, pages 106803.
Crossref
Cenk ŞAHİN. (2016) Dinamik Teslim Zamanı Atama Problemi için Holonik Sistem Tasarımı. Çukurova Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi 31:1, pages 149-158.
Crossref
Zhaoxia GuoZhaoxia Guo. 2016. Intelligent Decision-making Models for Production and Retail Operations. Intelligent Decision-making Models for Production and Retail Operations 63 85 .
Lei Xiao. 2014. Proceedings of the 2013 International Conference on Electrical and Information Technologies for Rail Transportation (EITRT2013)-Volume II. Proceedings of the 2013 International Conference on Electrical and Information Technologies for Rail Transportation (EITRT2013)-Volume II 593 600 .
Pedro Palominos, Victor Parada, Gustavo Gatica & Andrés Véjar. 2012. Hybrid Algorithms for Service, Computing and Manufacturing Systems. Hybrid Algorithms for Service, Computing and Manufacturing Systems 158 177 .
Shisheng Li, C.T. Ng & Jinjiang Yuan. (2011) Group scheduling and due date assignment on a single machine. International Journal of Production Economics 130:2, pages 230-235.
Crossref
Z. X. Guo, W. K. Wong, S. Y. S. Leung, J. T. Fan & S. F. Chan. (2006) A genetic-algorithm-based optimization model for scheduling flexible assembly lines. The International Journal of Advanced Manufacturing Technology 36:1-2, pages 156-168.
Crossref
Gur Mosheiov & Uri Yovel. (2006) Minimizing weighted earliness–tardiness and due-date cost with unit processing-time jobs. European Journal of Operational Research 172:2, pages 528-544.
Crossref
José A Ventura & Sanjay Radhakrishnan. (2003) Single machine scheduling with symmetric earliness and tardiness penalties. European Journal of Operational Research 144:3, pages 598-612.
Crossref
Valery Gordon, Jean-Marie Proth & Chengbin Chu. (2002) A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research 139:1, pages 1-25.
Crossref
V. T'kindt & J.-C. Billaut. (2002) Multicriteria scheduling problems: a survey. RAIRO - Operations Research 35:2, pages 143-163.
Crossref
N. V. R. Mahadev, Aleksandar Pekeč & Fred S. Roberts. (1998) On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?. Operations Research 46:3-supplement-3, pages S120-S134.
Crossref
R.J.W. James & J.T. Buchanan. (1997) A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem. European Journal of Operational Research 102:3, pages 513-527.
Crossref
N.V.R. Mahadev, A. Pekec & F.S. Roberts. (1997) Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties. Mathematical and Computer Modelling 25:11, pages 9-22.
Crossref
V. Sridharan & Z. Zhou. (1996) A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems. European Journal of Operational Research 94:2, pages 292-301.
Crossref
Zhi-Long Chen. (1996) Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. European Journal of Operational Research 93:1, pages 49-60.
Crossref
Qi Hao, Zihou Yang, Dingwei Wang & Zheng Li. (1996) Common due-date determination and sequencing using tabu search. Computers & Operations Research 23:5, pages 409-417.
Crossref
G.I. Adamopoulos & C.P. Pappis. (1996) Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method. European Journal of Operational Research 88:2, pages 336-344.
Crossref
X. Cai. (1995) Minimization of agreeably weighted variance in single machine systems. European Journal of Operational Research 85:3, pages 576-592.
Crossref
G.I. Adamopoulos & C.P. Pappis. (1995) The CON due-date determination method with processing time-dependent lateness penalties. International Journal of Production Economics 40:1, pages 29-36.
Crossref
N.I. Karacapilidis & C.P. Pappis. (1993) Optimal due date determination and sequencing of jobs on a single machine using the SLK method. Computers in Industry 21:3, pages 335-339.
Crossref
Prabuddha De, Jay B. Ghosh & Charles E. Wells. (1993) On the general solution for a class of early/tardy problems. Computers & Operations Research 20:2, pages 141-149.
Crossref
Chang S. Sung & U.G. Joo. (1992) A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date. Computers & Operations Research 19:8, pages 757-766.
Crossref
Prabuddha De, Jay B. Ghosh & Charles E. Wells. (1992) Optimal due-date assignment and sequencing. European Journal of Operational Research 57:3, pages 323-331.
Crossref
Prabuddha De, Jay B. Ghosh & Charles E. Wells. (2007) Optimal Delivery Time Quotation and Order Sequencing. Decision Sciences 22:2, pages 379-390.
Crossref
Prabuddha De, Jay B. Ghosh & Charles E. Wells. (1991) Scheduling to minimize weighted earliness and tardiness about a common due-date. Computers & Operations Research 18:5, pages 465-475.
Crossref
Y.P. Gupta, C.R. Bector & M.C. Gupta. (1990) Optimal schedule on a single machine using various due date determination methods. Computers in Industry 15:3, pages 245-254.
Crossref
R. Meenakshi Sundaram & Wen-shiom Lian. (1990) A computerized algorithm for scheduling dependent jobs with weights in a single machine. Computers & Industrial Engineering 19:1-4, pages 11-16.
Crossref
Prabuddha De, Jay B. Ghosh & Charles E. Wells. (1990) CON due-date determination and sequencing. Computers & Operations Research 17:4, pages 333-342.
Crossref
L.C. Hendry & B.G. Kingsman. (1989) Production planning systems and their applicability to make-to-order companies. European Journal of Operational Research 40:1, pages 1-15.
Crossref
T.C.E. Cheng & M.C. Gupta. (1989) Survey of scheduling research involving due date determination decisions. European Journal of Operational Research 38:2, pages 156-166.
Crossref
C.R. Bector, Y.P. Gupta & M.C. Gupta. (1989) V-shape property of optimal sequence of jobs about a common due date on a single machine. Computers & Operations Research 16:6, pages 583-588.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.