due date assignment problem

Information

• Author Services

Initiatives

You are accessing a machine-readable page. In order to be human-readable, please install an RSS reader.

All articles published by MDPI are made immediately available worldwide under an open access license. No special permission is required to reuse all or part of the article published by MDPI, including figures and tables. For articles published under an open access Creative Common CC BY license, any part of the article may be reused without permission provided that the original article is clearly cited. For more information, please refer to https://www.mdpi.com/openaccess .

Feature papers represent the most advanced research with significant potential for high impact in the field. A Feature Paper should be a substantial original Article that involves several techniques or approaches, provides an outlook for future research directions and describes possible research applications.

Feature papers are submitted upon individual invitation or recommendation by the scientific editors and must receive positive feedback from the reviewers.

Editor’s Choice articles are based on recommendations by the scientific editors of MDPI journals from around the world. Editors select a small number of articles recently published in the journal that they believe will be particularly interesting to readers, or important in the respective research area. The aim is to provide a snapshot of some of the most exciting work published in the various research areas of the journal.

Original Submission Date Received: .

• Active Journals
• Find a Journal
• Proceedings Series
• For Authors
• For Reviewers
• For Editors
• For Librarians
• For Publishers
• For Societies
• For Conference Organizers
• Open Access Policy
• Institutional Open Access Program
• Special Issues Guidelines
• Editorial Process
• Research and Publication Ethics
• Article Processing Charges
• Testimonials
• Preprints.org
• SciProfiles
• Encyclopedia

Article Menu

• Subscribe SciFeed
• Recommended Articles
• Google Scholar
• on Google Scholar
• Table of Contents

Find support for a specific problem in the support section of our website.

Please let us know what you think of our products and services.

Visit our dedicated information section to learn more about MDPI.

JSmol Viewer

The due date assignment scheduling problem with delivery times and truncated sum-of-processing-times-based learning effect.

1. Introduction

2. literature review, 3. notation and problem statement, 4. research method, 4.1. the problem 1 | p j [ k ] a = p j max { ( 1 + ∑ i = 1 k − 1 p [ i ] ) a , β } , q p s d , c o n | ∑ j = 1 n ( α u j + δ v j + η d ).

4.2. The Problem 1 | p j [ k ] A = p j max { ( 1 + ∑ i = 1 k − 1 p [ i ] ) a , β } , q p s d , S L K | ∑ j = 1 n ( α U j + δ V j + η q )

4.3. The Problem 1 | p j [ k ] A = p j max { ( 1 + ∑ i = 1 k − 1 p [ i ] ) a , β } , q p s d , D I F | ∑ j = 1 n ( α U j + δ V j + η d j )

5. Discussion of Results

5.1. numerical discussion, 5.2. extension, 6. conclusions, author contributions, data availability statement, acknowledgments, conflicts of interest.

• Cheng, T.C.E.; Cheng, S.R.; Wu, W.H.; Hsu, P.H.; Wu, C.C. A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. Comput. Ind. Eng. 2011 , 60 , 534–541. [ Google Scholar ] [ CrossRef ]
• Li, L.; Yang, S.W.; Wu, Y.B.; Huo, Y.Z.; Ji, P. Single machine scheduling jobs with a truncated sum-of-processing-times-based learning effect. Int. J. Adv. Manuf. Technol. 2013 , 67 , 261–267. [ Google Scholar ] [ CrossRef ]
• Cheng, T.C.E.; Wu, C.C.; Chen, J.C.; Wu, W.H.; Cheng, S.R. Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. Int. J. Prod. Econ. 2013 , 141 , 79–86. [ Google Scholar ] [ CrossRef ]
• Wu, Y.B.; Wang, J.J. Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times. Neural Comput. Appl. 2016 , 27 , 937–943. [ Google Scholar ] [ CrossRef ]
• Wang, J.B.; Liu, M.; Yin, N. Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects. J. Ind. Manag. Optim. 2017 , 13 , 1025. [ Google Scholar ] [ CrossRef ] [ Green Version ]
• Wu, C.C.; Wang, D.J.; Cheng, S.R.; Chung, I.H.; Lin, W.C. A two-stage three-machine assembly scheduling problem with a position-based learning effect. Int. J. Prod. Res. 2018 , 56 , 3064–3079. [ Google Scholar ] [ CrossRef ]
• Yin, N. Single machine due window assignment resource allocation scheduling with job-dependent learning effect. J. Appl. Math. Comput. 2018 , 56 , 715–725. [ Google Scholar ] [ CrossRef ]
• Zhang, X. Single machine and flowshop scheduling problems with sum-of-processing time based learning phenomenon. J. Ind. Manag. Optim. 2020 , 16 , 231. [ Google Scholar ] [ CrossRef ] [ Green Version ]
• Qian, J.; Lin, H.; Kong, Y.; Wang, Y. Tri-criteria single machine scheduling model with release times and learning factor. Appl. Math. Comput. 2020 , 387 , 124543. [ Google Scholar ] [ CrossRef ]
• Zou, Y.; Wang, D.; Lin, W.C.; Chen, J.Y.; Yu, P.W.; Wu, W.H.; Chao, Y.P.; Wu, C.C. Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect. Soft Comput. 2020 , 24 , 5445–5462. [ Google Scholar ] [ CrossRef ]
• Wu, C.C.; Zhang, X.; Azzouz, A.; Shen, W.L.; Cheng, S.R.; Hsu, P.H.; Lin, W.C. Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function. Eng. Optim. 2021 , 53 , 843–866. [ Google Scholar ] [ CrossRef ]
• Yang, S.J.; Hsu, C.J.; Chang, T.R.; Yang, D.L. Single-machine scheduling with past-sequence-dependent delivery times and learning effect. J. Chin. Inst. Ind. Eng. 2011 , 28 , 247–255. [ Google Scholar ] [ CrossRef ]
• Yang, S.J.; Yang, D.L. Single-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times. J. Oper. Res. Soc. 2012 , 63 , 1508–1515. [ Google Scholar ] [ CrossRef ]
• Liu, M.; Wang, S.; Chu, C. Scheduling deteriorating jobs with past-sequence-dependent delivery times. Int. J. Prod. Econ. 2013 , 144 , 418–421. [ Google Scholar ] [ CrossRef ]
• Zhao, C.; Tang, H. Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times. J. Appl. Math. Comput. 2014 , 45 , 259–274. [ Google Scholar ] [ CrossRef ]
• Qian, J.; Han, H. The due date assignment scheduling problem with the deteriorating jobs and delivery time. J. Appl. Math. Comput. 2021 , 1–14, in press. [ Google Scholar ] [ CrossRef ]
• Yin, Y.; Liu, M.; Cheng, T.C.E.; Wu, C.C.; Cheng, S.R. Four single-machine scheduling problems involving due date determination decisions. Inf. Sci. 2013 , 251 , 164–181. [ Google Scholar ] [ CrossRef ]
• Lu, Y.Y.; Li, G.; Wang, Y.B.; Ji, P. Optimal due-date assignment problem with learning effect and resource-dependent processing times. Optim. Lett. 2014 , 8 , 113–127. [ Google Scholar ] [ CrossRef ]
• Li, G.; Luo, M.L.; Zhang, W.J.; Wang, X.Y. Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation. Int. J. Prod. Res. 2015 , 53 , 1228–1241. [ Google Scholar ] [ CrossRef ]
• Sun, L.H.; Cui, K.; Chen, J.H.; Wang, J. Due date assignment and convex resource allocation scheduling with variable job processing times. Int. J. Prod. Res. 2016 , 54 , 3551–3560. [ Google Scholar ] [ CrossRef ]
• Geng, X.N.; Wang, J.B.; Bai, D. Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Eng. Optim. 2019 , 51 , 1301–1323. [ Google Scholar ] [ CrossRef ]
• Liu, W.; Jiang, C. Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Eng. Optim. 2020 , 52 , 74–89. [ Google Scholar ] [ CrossRef ]
• Tian, Y. Single–Machine Due-Window Assignment Scheduling with Resource Allocation and Generalized Earliness/Tardiness Penalties. Asia-Pac. J. Oper. Res. 2021 , in press. [ Google Scholar ] [ CrossRef ]
• Wang, W. Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times. J. Appl. Math. Comput. 2021 , in press. [ Google Scholar ] [ CrossRef ]
• Lann, A.; Mosheiov, G. Single machine scheduling to minimize the number of early and tardy jobs. Comput. Oper. Res. 1996 , 23 , 769–781. [ Google Scholar ] [ CrossRef ]
• Yuan, J. Unary NP-hardness of minimizing the number of tardy jobs with deadlines. J. Sched. 2017 , 20 , 211–218. [ Google Scholar ] [ CrossRef ]
• Hermelin, D.; Karhi, S.; Pinedo, M.; Shabtay, D. New algorithms for minimizing the weighted number of tardy jobs on a single machine. Ann. Oper. Res. 2021 , 298 , 271–287. [ Google Scholar ] [ CrossRef ] [ Green Version ]
• Graham, R.L.; Lawler, E.L.; Lenstra, J.K.; Kan, A.H.G.R. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discret. Math. 1979 , 5 , 287–326. [ Google Scholar ]

Click here to enlarge figure

Share and Cite

Qian, J.; Zhan, Y. The Due Date Assignment Scheduling Problem with Delivery Times and Truncated Sum-of-Processing-Times-Based Learning Effect. Mathematics 2021 , 9 , 3085. https://doi.org/10.3390/math9233085

Qian J, Zhan Y. The Due Date Assignment Scheduling Problem with Delivery Times and Truncated Sum-of-Processing-Times-Based Learning Effect. Mathematics . 2021; 9(23):3085. https://doi.org/10.3390/math9233085

Qian, Jin, and Yu Zhan. 2021. "The Due Date Assignment Scheduling Problem with Delivery Times and Truncated Sum-of-Processing-Times-Based Learning Effect" Mathematics 9, no. 23: 3085. https://doi.org/10.3390/math9233085

Article Metrics

Article access statistics, further information, mdpi initiatives, follow mdpi.

Subscribe to receive issue release notifications and newsletters from MDPI journals

Login to your account

Change password, your password must have 8 characters or more and contain 3 of the following:.

• a lower case character, 
• an upper case character, 
• a special character 

Password Changed Successfully

Your password has been changed

Create a new account

Can't sign in? Forgot your password?

Enter your email address below and we will send you the reset instructions

If the address matches an existing account you will receive an email with instructions to reset your password

Request Username

Can't sign in? Forgot your username?

Enter your email address below and we will send you your username

If the address matches an existing account you will receive an email with instructions to retrieve your username

• This Journal
•   
• Institutional Access

Cookies Notification

Our site uses javascript to enchance its usability. you can disable your ad blocker or whitelist our website www.worldscientific.com to view the full content., select your blocker:, adblock plus instructions.

• Click the AdBlock Plus icon in the extension bar
• Click the blue power button
• Click refresh

Adblock Instructions

• Click the AdBlock icon
• Click "Don't run on pages on this site"

uBlock Origin Instructions

• Click on the uBlock Origin icon in the extension bar
• Click on the big, blue power button
• Refresh the web page

uBlock Instructions

• Click on the uBlock icon in the extension bar

Adguard Instructions

• Click on the Adguard icon in the extension bar
• Click on the toggle next to the "Protection on this website" text

Brave Instructions

• Click on the orange lion icon to the right of the address bar
• Click the toggle on the top right, shifting from "Up" to "Down

Adremover Instructions

• Click on the AdRemover icon in the extension bar
• Click the "Don’t run on pages on this domain" button
• Click "Exclude"

Adblock Genesis Instructions

• Click on the Adblock Genesis icon in the extension bar
• Click on the button that says "Whitelist Website"

Super Adblocker Instructions

• Click on the Super Adblocker icon in the extension bar
• Click on the "Don’t run on pages on this domain" button
• Click the "Exclude" button on the pop-up

Ultrablock Instructions

• Click on the UltraBlock icon in the extension bar
• Click on the "Disable UltraBlock for ‘domain name here’" button

Ad Aware Instructions

• Click on the AdAware icon in the extension bar
• Click on the large orange power button

Ghostery Instructions

• Click on the Ghostery icon in the extension bar
• Click on the "Trust Site" button

Firefox Tracking Protection Instructions

• Click on the shield icon on the left side of the address bar
• Click on the toggle that says "Enhanced Tracking protection is ON for this site"

Duck Duck Go Instructions

• Click on the DuckDuckGo icon in the extension bar
• Click on the toggle next to the words "Site Privacy Protection"

Privacy Badger Instructions

• Click on the Privacy Badger icon in the extension bar
• Click on the button that says "Disable Privacy Badger for this site"

Disconnect Instructions

• Click on the Disconnect icon in the extension bar
• Click the button that says "Whitelist Site"

Opera Instructions

• Click on the blue shield icon on the right side of the address bar
• Click the toggle next to "Ads are blocked on this site"

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

A single machine group scheduling problem with due date assignment and position-dependent costs.

• Ying Chen , 
• Guiqing Zhang , and 
• Yongxi Cheng

School of Management, Xi’an Jiaotong University, Xi’an 710049, P. R. China

E-mail Address: [email protected]

Search for more papers by this author

School of Economics and Management, Xi’an University of Technology, Xi’an 710054, P. R. China

School of Economics and Finance, Xi’an Jiaotong University, Xi’an 710049, P. R. China

Corresponding author.

State Key Lab for Manufacturing Systems Engineering, Xi’an 710049, P. R. China

In this paper, we study a single machine scheduling problem with due date assignment under a group technology environment. The due dates of jobs are assignable according to the following three methods: the common (CON) due date assignment, the slack (SLK) due date assignment, and the different (DIF) due date assignment. Our objective is to determine a group sequence and job sequences within all groups, together with a due date assignment, to minimize a total cost function including earliness, tardiness, due date assignment and flow time costs, in which all unit costs are different and position-dependent. We present a unified O ( n log n ) time algorithm to solve the problem for all the three due date assignment methods.

• Single machine scheduling
• group technology
• due date assignment
• position-dependent costs
• Brucker, P ( 2001 ). Scheduling Algorithms . Berlin, Germany: Springer. Crossref ,  Google Scholar
• Chen, Y and Y Cheng ( 2021 ). Group scheduling and due date assignment without restriction on a single machine . Advances in Production Management Systems , 632 , 250–257. Google Scholar
• Choi, B and M Park ( 2021 ). Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty . Journal of Combinatorial Optimization , 41 , 781–793. Crossref , Web of Science ,  Google Scholar
• Graham, RL, EL Lawler, JK Lenstra and AHGR Kan ( 1979 ). Optimization and approximation in deterministic sequencing and scheduling: A survey . Annals of Discrete Mathematics , 5 , 287–326. Crossref ,  Google Scholar
• Ham, I, K Hitomi and T Yoshida ( 1985 ). Group Technology: Applications to Production Management . Boston: Kluwer-Nijhoff. Crossref ,  Google Scholar
• Hardy, GH, JE Littlewood and G Polya ( 1967 ). Inequalities . London: Cambridge University Press. Google Scholar
• Keshavarz, T, M Savelsbergh and N Salmasi ( 2015 ). A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties . Applied Mathematical Modelling , 39 (20), 6410–6424. Crossref , Web of Science ,  Google Scholar
• Li, S, CT Ng and J Yuan ( 2011 ). Group scheduling and due date assignment on a single machine . International Journal of Production Economics , 130 (2), 230–235. Crossref , Web of Science ,  Google Scholar
• Liu, W, X Hu and X Wang ( 2017 ). Single machine scheduling with slack due dates assignment . Engineering Optimization , 49 (4), 709–717. Crossref , Web of Science ,  Google Scholar
• Lv, D, S Luo, J Xue, J Xu and J Wang ( 2021 ). A note on single machine common flow allowance group scheduling with learning effect and resource allocation . Computers & Industrial Engineering , 151 , 106941. Crossref , Web of Science ,  Google Scholar
• Neufeld, J, J Gupta and U Buscher ( 2016 ). A comprehensive review of flowshop group scheduling literature . Computers & Operations Research , 70 , 56–74. Crossref , Web of Science ,  Google Scholar
• Panwalkar, SS, ML Smith and A Seidmann ( 1982 ). Common due date assignment to minimize total penalty for the one machine scheduling problem . Operations Research , 30 (2), 391–399. Crossref , Web of Science ,  Google Scholar
• Seidmann, A, SS Panwalkar and ML Smith ( 1981 ). Optimal assignment of due-dates for a single processor scheduling problem . International Journal of Production Research , 19 (4), 393–399. Crossref , Web of Science ,  Google Scholar
• Shabtay, D ( 2016 ). Optimal restricted due date assignment in scheduling . European Journal of Operational Research , 252 (1), 79–89. Crossref , Web of Science ,  Google Scholar
• Shabtay, D et al. ( 2010 ). Optimal due date assignment and resource allocation in a group technology scheduling environment . Computers & Operations Research , 37 (12), 2218–2228. Crossref , Web of Science ,  Google Scholar
• Sun, X, XN Geng and T Liu ( 2020 ). Due-window assignment scheduling in the proportionate flow shop setting . Annals of Operations Research , 292 , 113–131. Crossref , Web of Science ,  Google Scholar
• Wang, L, M Liu, J Wang, Y Lu and W Liu ( 2021 ). Optimization for due-date assignment single-machine scheduling under group technology . Complexity , 2021 , 1–9. Web of Science ,  Google Scholar
• Wang, D, Y Yin, J Xu, W Wu, S Cheng and C Wu ( 2015 ). Some due date determination scheduling problems with two agents on a single machine . International Journal of Production Economics , 168 , 81–90. Crossref , Web of Science ,  Google Scholar
• Yang, L, Y Zhao and X Ma ( 2019 ). Group maintenance scheduling for two-component systems with failure interaction . Applied Mathematical Modelling , 71 , 118–137. Crossref , Web of Science ,  Google Scholar
• Yin, N, L Kang and X Wang ( 2014 ). Single machine group scheduling with processing times dependent on position, starting time and allotted resource . Applied Mathematical Modelling , 38 (19–20), 4602–4613. Crossref , Web of Science ,  Google Scholar

• Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling Oğuzhan Ahmet Arık 1 March 2024 | OPSEARCH, Vol. 26

Recommended

Received 17 August 2022 Revised 16 December 2022 Accepted 13 January 2023 Published: 18 March 2023

Academia.edu no longer supports Internet Explorer.

To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to  upgrade your browser .

Enter the email address you signed up with and we'll email you a reset link.

• We're Hiring!
• Help Center

Two due date assignment problems in scheduling a single machine

2006, Operations Research Letters

Related Papers

Annals of Operations Research

Dvir Shabtay

We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomial- time algorithm to find the optimal job sequence, due date values and resource allocation minimizing an objective function which includes earliness, tardiness, due date assignment, makespan and total resource consumption costs.

Computers & Operations Research

European Journal of Operational Research

Vitaly Strusevich

International Journal of Production Economics

T. C. E. Cheng

Journal of Industrial and Management Optimization

HUYNH TUONG NGUYEN

Naval Research Logistics

Candace Yano

Charles Wells

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

RELATED TOPICS

•   We're Hiring!
•   Help Center
• Find new research papers in:
• Health Sciences
• Earth Sciences
• Cognitive Science
• Mathematics
• Computer Science
• Academia ©2024

Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs

New citation alert added.

This alert has been successfully added and will be sent to:

You will be notified whenever a record that you have chosen has been cited.

To manage your alert preferences, click on the button below.

New Citation Alert!

Please log in to your account

Information & Contributors

Bibliometrics & citations, view options, recommendations, common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost.

e consider a single-machine batch delivery scheduling and common due date assignment problem. In addition to making decisions on sequencing the jobs, determining the common due date, and scheduling job delivery, we consider the option of performing a ...

Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs

In this paper, we explore a single-machine scheduling problem in which the processing time of a job is a linear increasing function of its starting time. The objective is to determine the optimal due date and schedule simultaneously to minimize a cost ...

Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed ...

Information

Published in.

Springer-Verlag

Berlin, Heidelberg

Publication History

Author tags.

• Combinatorial optimization
• Delivery time
• Due date assignment
• Research-article

Contributors

Other metrics, bibliometrics, article metrics.

• 0 Total Citations
• 0 Total Downloads
• Downloads (Last 12 months) 0
• Downloads (Last 6 weeks) 0

View options

Login options.

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Share this publication link.

Copying failed.

Share on social media

Affiliations, export citations.

• Please download or close your previous search result export first before starting a new bulk export. Preview is not available. By clicking download, a status dialog will open to start the export process. The process may take a few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress. Download
• Download citation
• Copy citation

We are preparing your search results for download ...

We will inform you here when the file is ready.

Your file of search results citations is now ready.

Your search export query has expired. Please try again.

Single-machine due date assignment problem with deteriorating jobs and resource-dependent processing times

• Original Article
• Published: 07 February 2013
• Volume 67 , pages 255–260, ( 2013 )

Cite this article

• Xiao-Yuan Wang 1 &
• Jian-Jun Wang 2  

314 Accesses

29 Citations

Explore all metrics

We study a single-machine earliness–tardiness scheduling problem with due date assignment, in which the processing time of a job is a function of its starting time and its resource allocation. We analyze the problem with two different processing time functions and three different due date assignment methods. The goal is to minimize an integrated objective function, which includes earliness, tardiness, due date assignment, and total resource consumption costs. For each combination of due date assignment method and processing time function, we provide a polynomial-time algorithm to find the optimal job sequence, due date values, and resource allocations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save.

• Get 10 units per month
• Download Article/Chapter or eBook
• 1 Unit = 1 Article or 1 Chapter
• Cancel anytime

Price includes VAT (Russian Federation)

Instant access to the full article PDF.

Rent this article via DeepDyve

Institutional subscriptions

Similar content being viewed by others

Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs

The due date assignment scheduling problem with the deteriorating jobs and delivery time

Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times.

Gawiejnowicz S (2008) Time-dependent scheduling. Springer, New York

MATH   Google Scholar  

Huang X, Wang M-Z (2011) Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties. Appl Math Model 35:1349–1353

Article   MathSciNet   MATH   Google Scholar  

Wang X-R, Huang X, Wang J-B (2011) Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties. Appl Math Model 35:3509–3515

Wang J-B, Wang J-J, Ji P (2011) Scheduling jobs with chain precedence constraints and deteriorating Jobs. J Oper Res Soc 62:1765–1770

Article   Google Scholar  

Zhao C-L, Tang H-Y (2011) A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints. Optim Lett 5:183–190

Huang X, Wang M-Z, Wang J-B (2011) Single machine group scheduling with both learning effects and deteriorating jobs. Comput Ind Eng 60:750–754

Ozturkoglu Y, Bulfin RL (2011) A unique integer mathematical model for scheduling deteriorating jobs with rate-modifying activities on a single machine. Int J Adv Manuf Technol 57:753–762

Lai P-J, Lee W-C, Chen H-H (2011) Scheduling with deteriorating jobs and past-sequence-dependent setup times. Int J Adv Manuf Technol 54:737–741

Wang L-Y, Feng E-M (2012) A note on single-machine scheduling problems with the effects of deterioration and learning. Int J Adv Manuf Technol 59:539–545

Shen P, Wei C-M, Wu Y-B (2012) A note on deteriorating jobs and learning effects on a single-machine scheduling with past-sequence-dependent setup times. Int J Adv Manuf Technol 58:723–725

Wei C-M, Wang J-B, Ji P (2012) Single-machine scheduling with time-and-resource-dependent processing times. Appl Math Model 36:792–798

Wang J-B, Wang M-Z (2012) Single-machine scheduling with nonlinear deterioration. Optim Lett 6:87–98

Wang J-B, Huang X, Wu Y-B, Ji P (2012) Group scheduling with independent setup times, ready times, and deteriorating job processing times. Int J Adv Manuf Technol 60:643–649

Sun L-H, Sun L-Y, Wang M-Z, Wang J-B (2012) Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines. Int J Prod Econ 138:195–200

Bai J, Li Z-R, Huang X (2012) Single-machine group scheduling with general deterioration and learning effects. Appl Math Model 36:1267–1274

Wang J-B, Wang M-Z, Ji P (2012) Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs. Int J Syst Sci 43:861–868

Article   MathSciNet   Google Scholar  

Huang X, Wang M-Z, Ji P (2012) Parallel machines scheduling with deteriorating and learning effects. Optim Lett. doi: 10.1007/s11590-012-0490-8

Google Scholar  

Wang J-B, Ji P, Cheng TCE, Wang D (2012) Minimizing makespan in a two-machine flow shop with effects of deterioration and learning. Optim Lett 6:1393–1409

Wang X-R, Wang J-J (2012) Single-machine scheduling with convex resource dependent processing times and deteriorating jobs. Appl Math Model. doi: 10.1016/j.apm.2012.05.025

Lee H-T, Yang D-L, Yang S-J (2012) Multi-machine scheduling with deterioration effects and maintenance activities for minimizing the total earliness and tardiness costs. Int J Adv Manuf Technol. doi: 10.1007/s00170-012-4348-0

Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discret Appl Math 155:1643–1666

Wang J-B, Xia Z-Q (2007) Single machine scheduling problems with controllable processing times and total absolute differences penalties. Eur J Oper Res 177:638–645

Article   MATH   Google Scholar  

Shabtay D, Steiner G (2008) The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Ann Oper Res 159:25–40

Tseng C-T, Liao C-T, Huang K-L (2009) Minimizing total tardiness on a single machine with controllable processing times. Comput Oper Res 36:1852–1858

Wang D, Wang M-Z, Wang J-B (2010) Single-machine scheduling with learning effect and resource-dependent processing times. Comput Ind Eng 59:458-462

Koulamas C, Gupta S, Kyparisis GJ (2010) A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times. Eur J Oper Res 205:479–482

Leyvand Y, Shabtay D, Steiner G (2010) A unified approach for scheduling with convex resource consumption functions using positional penalties. Eur J Oper Res 206:301–312

Zhu Z, Sun L, Chu F, Liu M (2011) Single-machine group scheduling with resource allocation and learning effect. Comput Ind Eng 60:148-157

Yin N, Wang X-Y (2011) Single-machine scheduling with controllable processing times and learning effect. Int J Adv Manuf Technol 54:743–748

Wang J-B, Wang M-Z (2012) Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time. Comput Oper Res 39:492–497

Lu Y-Y, Li G, Wu Y-B, Ji P (2012) Optimal due-date assignment problem with learning effect and resource-dependent processing times. Optim Lett. doi: 10.1007/s11590-012-0467-7

Gordon VS, Proth JM, Chu CB (2002) A survey of the state-of-the-art of common due date assignment and scheduling research. Eur J Oper Res 139:1–25

Panwalker SS, Smith ML, Seidmann A (1982) Common due-date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30:391–399

Adamopoulos GI, Pappis CP (1996) Single machine scheduling with flow allowances. J Oper Res Soc 47:1280–1285

Seidmann A, Panwalkar SS, Smith ML (1981) Optimal assignment of due dates for a single processor scheduling problem. Int J Prod Res 19:393–399

Hardy GH, Littlewood JE, Polya G (1967) Inequalities. Cambridge University Press, Cambridge

Download references

Author information

Authors and affiliations.

School of Science, Shenyang Aerospace University, Shenyang, 110136, China

Xiao-Yuan Wang

Faculty of Management and Economics, Dalian University of Technology, Dalian, 116024, China

Jian-Jun Wang

You can also search for this author in PubMed   Google Scholar

Corresponding author

Correspondence to Xiao-Yuan Wang .

Rights and permissions

Reprints and permissions

About this article

Wang, XY., Wang, JJ. Single-machine due date assignment problem with deteriorating jobs and resource-dependent processing times. Int J Adv Manuf Technol 67 , 255–260 (2013). https://doi.org/10.1007/s00170-013-4771-x

Download citation

Received : 15 June 2012

Accepted : 04 December 2012

Published : 07 February 2013

Issue Date : July 2013

DOI : https://doi.org/10.1007/s00170-013-4771-x

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

• Single machine
• Resource allocation
• Due date assignment
• Deteriorating jobs
• Find a journal
• Publish with us
• Track your research

• DOI: 10.1155/2015/683269
• Corpus ID: 121001336

Scheduling Problems with Due Date Assignment

• Yunqiang Yin , Shuenn-Ren Cheng , +3 authors Chin-Chia Wu
• Published in Due Date-Related Scheduling… 12 April 2015
• Computer Science
• Due Date-Related Scheduling with Two Agents

One Citation

Results of parallel-machine scheduling model with maintenance activity considering time-dependent deterioration, delivery times, and resource allocation, related papers.

Showing 1 through 3 of 0 Related Papers