Minimising earliness and tardiness penalties in single machine scheduling against common due date using imperialist competitive algorithm

Author： Yousefi Milad Yusuff Rosnah Mohd

Publisher： Taylor & Francis Ltd

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.51, Iss.16, 2013-08, pp. : 4797-4804

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date

By Webster S. Jog D. Gupta A.

International Journal of Production Research, Vol. 36, Iss. 9, 1998-09 ,pp. : 2543-2551

Taylor & Francis Ltd

Access to resources Recommend Favorite

Permutation flow shop scheduling with earliness and tardiness penalties

By Chandra Pankaj

International Journal of Production Research, Vol. 47, Iss. 20, 2009-01 ,pp. : 5591-5610

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling job families about an unrestricted common due date on a single machine

By Azizoglu M. Webster S.

International Journal of Production Research, Vol. 35, Iss. 5, 1997-05 ,pp. : 1321-1330

Taylor & Francis Ltd

Access to resources Recommend Favorite

Stochastic single machine scheduling with random common due date

By Benmansour Rachid

International Journal of Production Research, Vol. 50, Iss. 13, 2012-07 ,pp. : 3560-3571

Taylor & Francis Ltd

Access to resources Recommend Favorite

Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times

By Radhakrishnan S. Ventura J. A.

International Journal of Production Research, Vol. 38, Iss. 10, 2000-07 ,pp. : 2233-2252

Taylor & Francis Ltd

Access to resources Recommend Favorite