article

A common due-date assignment problem on parallel identical machines

Author:

Gur MosheiovAuthors Info & Claims

Computers and Operations Research, Volume 28, Issue 8

Pages 719 - 732

https://doi.org/10.1016/S0305-0548(99)00127-6

Published: 01 July 2001 Publication History

Abstract

No abstract available.

Cited By

View all

Yin YCheng TXu DWu C(2012)Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery costComputers and Industrial Engineering10.1016/j.cie.2012.02.01563:1(223-234)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.1016/j.cie.2012.02.015
Li JYuan XLee EXu D(2011)Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machineComputers & Mathematics with Applications10.1016/j.camwa.2011.09.06362:11(4126-4139)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1016/j.camwa.2011.09.063
Shabtay DSteiner GYedidsion L(2010)Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environmentsDiscrete Applied Mathematics10.1016/j.dam.2010.02.010158:10(1090-1103)Online publication date: 1-May-2010
https://dl.acm.org/doi/10.1016/j.dam.2010.02.010
Show More Cited By

Index Terms

A common due-date assignment problem on parallel identical machines
1. Computing methodologies
  1. Artificial intelligence
    1. Planning and scheduling
    2. Search methodologies
      1. Heuristic function construction
2. Theory of computation

Recommendations

Common due date assignment and scheduling with ready times

We consider the problem of scheduling a set of nonsimultaneously available jobs on one machine. Each job has a ready time only at or after which the job can be processed. All the jobs have a common due date, which needs to be determined. The problem is ...
Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs

We consider a problem of scheduling n identical nonpreemptive jobs with a common due date on m uniform parallel machines. The objective is to determine an optimal value of the due date and an optimal allocation of jobs onto machines so as to minimize a ...
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 ...

Comments

Information & Contributors

Information

Published In

cover image Computers and Operations Research

Computers and Operations Research Volume 28, Issue 8

July 1 2001

112 pages

ISSN:0305-0548

Editor:
Samuel J. Raff

Issue’s Table of Contents

Publisher

Elsevier Science Ltd.

United Kingdom

Publication History

Published: 01 July 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yin YCheng TXu DWu C(2012)Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery costComputers and Industrial Engineering10.1016/j.cie.2012.02.01563:1(223-234)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.1016/j.cie.2012.02.015
Li JYuan XLee EXu D(2011)Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machineComputers & Mathematics with Applications10.1016/j.camwa.2011.09.06362:11(4126-4139)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1016/j.camwa.2011.09.063
Shabtay DSteiner GYedidsion L(2010)Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environmentsDiscrete Applied Mathematics10.1016/j.dam.2010.02.010158:10(1090-1103)Online publication date: 1-May-2010
https://dl.acm.org/doi/10.1016/j.dam.2010.02.010
Li JSun KXu DLi H(2010)Single machine due date assignment scheduling problem with customer service level in fuzzy environmentApplied Soft Computing10.1016/j.asoc.2009.10.00210:3(849-858)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1016/j.asoc.2009.10.002
Shabtay D(2008)Due date assignments and scheduling a single machine with a general earliness/tardiness cost functionComputers and Operations Research10.1016/j.cor.2006.08.01735:5(1539-1545)Online publication date: 1-May-2008
https://dl.acm.org/doi/10.1016/j.cor.2006.08.017
Shabtay DSteiner G(2008)Optimal due date assignment in multi-machine scheduling environmentsJournal of Scheduling10.1007/s10951-007-0015-y11:3(217-228)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1007/s10951-007-0015-y
Janiak AWinczaszek M(2005)Common due window assignment in parallel processor scheduling problem with nonlinear penalty functionsProceedings of the 6th international conference on Parallel Processing and Applied Mathematics10.1007/11752578_17(132-139)Online publication date: 11-Sep-2005
https://dl.acm.org/doi/10.1007/11752578_17

Abstract

Cited By

Index Terms

Recommendations

Common due date assignment and scheduling with ready times

Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs

Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations