Advanced search
Publication Cover
Journal of the Operational Research Society Volume 56, 2005 - Issue 5
Submit an article Journal homepage
21
Views
14
CrossRef citations to date
0
Altmetric
Theoretical Paper

Improved lower bounds for the early/tardy scheduling problem with no idle time

J M S ValenteFaculdade de Economia do PortoPortoPortugalCorrespondence[email protected]
&
R A F S AlvesFaculdade de Economia do PortoPortoPortugal
Pages 604-612 | Received 01 Jun 2004, Accepted 01 Jul 2004, Published online: 21 Dec 2017

Citations (14)

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

J M S Valente. (2010) Beam search heuristics for quadratic earliness and tardiness scheduling. Journal of the Operational Research Society 61:4, pages 620-631.
Read now
Mehdi Mahnam & Ghasem Moslehi. (2009) A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times. Engineering Optimization 41:6, pages 521-536.
Read now

Articles from other publishers (12)

Mehdi Mahnam, Ghasem Moslehi & Seyyed Mohammad Taghi Fatemi Ghomi. (2013) Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness. Mathematical and Computer Modelling 57:9-10, pages 2549-2563.
Crossref
Shyam Sundar & Alok Singh. (2012) A swarm intelligence approach to the early/tardy scheduling problem. Swarm and Evolutionary Computation 4, pages 25-32.
Crossref
Jorge M. S. Valente, Maria R. A. Moreira, Alok Singh & Rui A. F. S. Alves. (2010) Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs. The International Journal of Advanced Manufacturing Technology 54:1-4, pages 251-265.
Crossref
F. Della Croce, E. Desmier & T. Garaix. (2011) A note on “Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time”. Computers & Industrial Engineering 60:1, pages 183-186.
Crossref
ALOK SINGH. (2011) A HYBRID PERMUTATION-CODED EVOLUTIONARY ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM. Asia-Pacific Journal of Operational Research 27:06, pages 713-725.
Crossref
Jorge M. S. Valente & Maria R. A. Moreira. (2009) Greedy randomised dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. The International Journal of Advanced Manufacturing Technology 44:9-10, pages 995-1009.
Crossref
Jorge M.S. Valente & Rui A.F.S. Alves. (2008) Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Computers & Operations Research 35:11, pages 3696-3713.
Crossref
Mehdi Mahnam & Ghasem Moslehi. (2008) An exact approach to minimizing the sum of maximum earliness and tardiness with unequal release times. An exact approach to minimizing the sum of maximum earliness and tardiness with unequal release times.
Jorge M.S. Valente. (2008) Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time. Computers & Industrial Engineering 55:3, pages 663-675.
Crossref
Jorge M.S. Valente. (2007) Dispatching heuristics for the single machine early/tardy scheduling problem with job-independent penalties. Computers & Industrial Engineering 52:4, pages 434-447.
Crossref
Jorge M.S. Valente. (2006) Local and global dominance conditions for the weighted earliness scheduling problem with no idle time. Computers & Industrial Engineering 51:4, pages 765-780.
Crossref
JORGE M. S. VALENTE, JOSÉ FERNANDO GONÇALVES & RUI A. F. S. ALVES. (2011) A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM. Asia-Pacific Journal of Operational Research 23:03, pages 393-405.
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.