Advanced search
Publication Cover
IIE Transactions Volume 18, 1986 - Issue 2
Submit an article Journal homepage
82
Views
59
CrossRef citations to date
0
Altmetric
TECHNICAL NOTE

Scheduling Problems With Generalized Due Dates

Nicholas G. Hall The Ohio State University, 301 Hagerty Hall 1775 College Road, Columbus, OH, 43210-1399
Pages 220-222 | Received 01 Feb 1985, Published online: 09 Jul 2007

Citations (59)

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 (11)

Rubing Chen, Yuan Gao, Zhichao Geng & Jinjiang Yuan. (2023) Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work. International Journal of Production Research 61:22, pages 7630-7648.
Read now
Byung-Cheon Choi, Myoung-Ju Park & Kyung Min Kim. (2022) Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty. Engineering Optimization 54:10, pages 1773-1786.
Read now
Jon M. Stauffer, Aly Megahed & Chelliah Sriskandarajah. (2021) Elasticity management for capacity planning in software as a service cloud computing. IISE Transactions 53:4, pages 407-424.
Read now
Enrique Gerstl & Gur Mosheiov. (2017) Single machine scheduling problems with generalised due-dates and job-rejection. International Journal of Production Research 55:11, pages 3164-3172.
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
J-G Kim & D-H Lee. (2009) Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times. Journal of the Operational Research Society 60:9, pages 1264-1272.
Read now
SHRIKANTS. PANWALKAR & SURYAD. LIMAN. (2002) Single operation earliness—tardiness scheduling with machine activation costs. IIE Transactions 34:5, pages 509-513.
Read now
ValeryS. Gordon, Jean-Marie Proth & Chengbin Chu. (2002) Due date assignment and scheduling: Slk, TWK and other due date assignment models. Production Planning & Control 13:2, pages 117-132.
Read now
XIAOGUANG YANG. (2000) Scheduling with generalized batch delivery dates and earliness penalties. IIE Transactions 32:8, pages 735-741.
Read now
CHUNG-LUN LI & T.C.E. CHENG. (1999) Due-date determination with resequencing. IIE Transactions 31:2, pages 183-188.
Read now
A. AGNETIS, R. MACCHIAROLI, D. PACCIARELLI & F. ROSSI. (1997) Assigning jobs to time frames on a single machine to minimize total tardiness. IIE Transactions 29:11, pages 965-976.
Read now

Articles from other publishers (48)

Lingfa Lu, Jinwen Ou, Xue Yu & Liqi Zhang. (2023) Order acceptance and scheduling with delivery under generalized parameters. Naval Research Logistics (NRL) 70:8, pages 844-857.
Crossref
Jan-Erik Justkowiak, Sergey Kovalev, Mikhail Y. Kovalyov & Erwin Pesch. (2023) Single machine scheduling with assignable due dates to minimize maximum and total late work. European Journal of Operational Research 308:1, pages 76-83.
Crossref
Matan Atsmony, Baruch Mor & Gur Mosheiov. (2023) Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity. Computers & Operations Research 152, pages 106133.
Crossref
Yi-Chen Su & Bertrand M.T. Lin. (2022) Minimizing the total weighted completion time in relocation scheduling. Computers & Industrial Engineering 173, pages 108662.
Crossref
Gur Mosheiov, Daniel Oron & Dvir Shabtay. (2022) On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. Journal of Scheduling 25:5, pages 577-587.
Crossref
Yubai Zhang, Zhao Zhang & Zhaohui Liu. (2020) The price of fairness for a two-agent scheduling game minimizing total completion time. Journal of Combinatorial Optimization 44:3, pages 2104-2122.
Crossref
Matan Atsmony & Gur Mosheiov. (2022) A Greedy heuristic for solving scheduling problems with bounded rejection cost. Computers & Operations Research 144, pages 105827.
Crossref
Byung-Cheon Choi, Kyung Min Kim, Yunhong Min & Myoung-Ju Park. (2022) A single machine scheduling with generalized and periodic due dates to minimize total deviation. Discrete Applied Mathematics 314, pages 31-52.
Crossref
Byung-Cheon Choi, Kyung Min Kim, Yunhong Min & Myoung-Ju Park. (2021) Scheduling with generalized and periodic due dates under single- and two-machine environments. Optimization Letters 16:2, pages 623-633.
Crossref
Long Wan, Desheng Li, Zhouli He, Hongyu Huang & Jiajie Mei. (2021) Scheduling with periodic due date to minimize the maximum tardiness. Scheduling with periodic due date to minimize the maximum tardiness.
Baruch Mor, Gur Mosheiov & Dvir Shabtay. (2021) Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. Journal of Scheduling 24:6, pages 553-567.
Crossref
Gur Mosheiov, Daniel Oron & Dvir Shabtay. (2021) Minimizing total late work on a single machine with generalized due-dates. European Journal of Operational Research 293:3, pages 837-846.
Crossref
Ting-Chun Lo & Bertrand M. T. Lin. (2021) Relocation Scheduling in a Two-Machine Flow Shop with Resource Recycling Operations. Mathematics 9:13, pages 1527.
Crossref
Byung-Cheon Choi & Myoung-Ju Park. (2021) Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty. Journal of Combinatorial Optimization 41:4, pages 781-793.
Crossref
Xue Yu, Lingfa Lu & Liqi Zhang. 2021. Combinatorial Optimization and Applications. Combinatorial Optimization and Applications 234 246 .
Enrique Gerstl & Gur Mosheiov. (2020) Single machine scheduling to maximize the number of on-time jobs with generalized due-dates. Journal of Scheduling 23:3, pages 289-299.
Crossref
Rubing Chen & Jinjiang Yuan. (2019) Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. 4OR 18:2, pages 177-196.
Crossref
Myoung-Ju Park, Byung-Cheon Choi, Yunhong Min & Kyung Min Kim. (2020) Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates. Asia-Pacific Journal of Operational Research 37:01, pages 1950032.
Crossref
Byung-Cheon Choi, Yunhong Min, Myoung-Ju Park & Kyung Min Kim. (2020) Production Scheduling considering Outsourcing Options and Carrier Costs. Journal of Advanced Transportation 2020, pages 1-9.
Crossref
Byung-Cheon Choi, Yunhong Min & Myoung-Ju Park. (2019) Strong NP-hardness of minimizing total deviation with generalized and periodic due dates. Operations Research Letters 47:5, pages 433-437.
Crossref
Byung-Cheon Choi & Myoung-Ju Park. (2018) Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals. Asia-Pacific Journal of Operational Research 35:06, pages 1850046.
Crossref
Myoung-Ju Park, Yun-Hong Min & Byung-Cheon Choi. (2018) Two-agent scheduling with generalized due dates. The Asian Journal of Shipping and Logistics 34:4, pages 345-350.
Crossref
Youjun Chen, Lingfa Lu & Jinjiang Yuan. (2016) Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time. Theoretical Computer Science 622, pages 45-65.
Crossref
Yuan Gao & Jinjiang Yuan. (2016) Unary NP-hardness of minimizing total weighted tardiness with generalized due dates. Operations Research Letters 44:1, pages 92-95.
Crossref
Du-Juan Wang, Yunqiang Yin, Jianyou Xu, Wen-Hsiang Wu, Shuenn-Ren Cheng & Chin-Chia Wu. (2015) Some due date determination scheduling problems with two agents on a single machine. International Journal of Production Economics 168, pages 81-90.
Crossref
Yuan Gao & Jinjiang Yuan. (2015) Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates. Discrete Applied Mathematics 189, pages 49-52.
Crossref
Baruch Mor, Gur Mosheiov & Dvir Shabtay. (2013) A note: Minmax due-date assignment problem with lead-time cost. Computers & Operations Research 40:8, pages 2161-2164.
Crossref
Jun-Gyu Kim, Jae-Min Yu & Dong-Ho Lee. (2013) Common Due-Date Assignment and Scheduling on Parallel Machines with Sequence-Dependent Setup Times. Management Science and Financial Engineering 19:1, pages 29-36.
Crossref
Yunqiang Yin, Shuenn-Ren Cheng, T.C.E. Cheng, Chin-Chia Wu & Wen-Hsiang Wu. (2012) Two-agent single-machine scheduling with assignable due dates. Applied Mathematics and Computation 219:4, pages 1674-1685.
Crossref
Valery Gordon, Vitaly Strusevich & Alexandre Dolgui. (2011) Scheduling with due date assignment under special conditions on job processing. Journal of Scheduling 15:4, pages 447-456.
Crossref
Jun-Gyu Kim, Ji-Su Kim & Dong-Ho Lee. (2012) Common Due-Date Assignment and Scheduling with Sequence-Dependent Setup Times: a Case Study on a Paper Remanufacturing System. Management Science and Financial Engineering 18:1, pages 1-12.
Crossref
Christos Koulamas. (2010) The single-machine total tardiness scheduling problem: Review and extensions. European Journal of Operational Research 202:1, pages 1-7.
Crossref
B.M.T. Lin & S.T. Liu. (2008) Maximizing the reward in the relocation problem with generalized due dates. International Journal of Production Economics 115:1, pages 55-63.
Crossref
Yu Xia, Bintong Chen & Jinfeng Yue. (2008) Job sequencing and due date assignment in a single machine shop with uncertain processing times. European Journal of Operational Research 184:1, pages 63-75.
Crossref
Yu Xia, Bintong Chen & Jinfeng Yue. 2005. Algorithmic Applications in Management. Algorithmic Applications in Management 261 269 .
Gur Mosheiov & Daniel Oron. (2004) A note on the SPT heuristic for solving scheduling problems with generalized due dates. Computers & Operations Research 31:5, pages 645-655.
Crossref
Xiangtong Qi, Gang Yu & Jonathan F. Bard. (2002) Single machine scheduling with assignable due dates. Discrete Applied Mathematics 122:1-3, pages 211-233.
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
Dirk Biskup & Wolfgang Piewitt. (2000) A note on ‘An efficient algorithm for the single-machine tardiness problem’. International Journal of Production Economics 66:3, pages 287-292.
Crossref
Valery Gordon & Wieslaw Kubiak. (1998) Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs. Information Processing Letters 68:3, pages 153-159.
Crossref
S. Dauzere-Peres. (1997) An efficient formulation for minimizing the number of late jobs in single-machine scheduling. An efficient formulation for minimizing the number of late jobs in single-machine scheduling.
Chengbin Chu. (2011) A new class of scheduling criteria and their optimization. RAIRO - Operations Research 30:2, pages 171-189.
Crossref
Stéphane Dauzère-Pérès. (1995) Minimizing late jobs in the general one machine scheduling problem. European Journal of Operational Research 81:1, pages 134-142.
Crossref
A. AGNETIS, R. MACCHIAROLI & D. PACCIARELLI. 1995. New Trends in Design of Control Systems 1994. New Trends in Design of Control Systems 1994 321 326 .
Han Hoogeveen & Steef Velde. 1995. Integer Programming and Combinatorial Optimization. Integer Programming and Combinatorial Optimization 292 306 .
A. Agnetis, R. Macchiargli & D. Pacciarelli. (1994) Input Sequencing for Assembly Lines a Cutting Plane Algorithm. IFAC Proceedings Volumes 27:11, pages 321-326.
Crossref
Parthasarati Dileepan. (1993) Common due date scheduling problem with separate earliness and tardiness penalties. Computers & Operations Research 20:2, pages 179-184.
Crossref
Nicholas G. Hall, Suresh P. Sethi & Chelliah Sriskandarajah. (1991) On the complexity of generalized due date scheduling problems. European Journal of Operational Research 51:1, pages 100-109.
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.