Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times

Author： Rajendran C. Ziegler H.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.149, Iss.3, 2003-09, pp. : 513-522

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

An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs

By Rajendran C. Ziegler H.

European Journal of Operational Research, Vol. 103, Iss. 1, 1997-11 ,pp. : 129-138

Elsevier

Access to resources Recommend Favorite

Scheduling jobs on parallel machines with sequence-dependent setup times

By Young H.L. Pinedo M.

European Journal of Operational Research, Vol. 100, Iss. 3, 1997-08 ,pp. : 464-474

Elsevier

Access to resources Recommend Favorite

A genetic algorithm for a re-entrant job-shop scheduling problem with sequence-dependent setup times

By Sun J. U.

Engineering Optimization, Vol. 41, Iss. 6, 2009-06 ,pp. : 505-520

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling with batch setup times and earliness-tardiness penalties

By Chen Z.-L.

European Journal of Operational Research, Vol. 96, Iss. 3, 1997-02 ,pp. : 518-537

Elsevier

Access to resources Recommend Favorite

A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times

By Gendreau M. Laporte G. Guimaraes E.M.

European Journal of Operational Research, Vol. 133, Iss. 1, 2001-08 ,pp. : 183-189

Elsevier

Access to resources Recommend Favorite