Minimizing the overhead for some tree-scheduling problems

Author： Bampis E. Guinand F. Trystram D.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.94, Iss.2, 1996-10, pp. : 261-270

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

Benchmarks for shop scheduling problems

By Demirkol E. Mehta S. Uzsoy R.

European Journal of Operational Research, Vol. 109, Iss. 1, 1998-08 ,pp. : 137-141

Elsevier

Access to resources Recommend Favorite

Scheduling problems with a learning effect

By Mosheiov G.

European Journal of Operational Research, Vol. 132, Iss. 3, 2001-08 ,pp. : 687-693

Elsevier

Access to resources Recommend Favorite

Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge

By Zegordi S.H. Itoh K. Enkawa T.

European Journal of Operational Research, Vol. 85, Iss. 3, 1995-09 ,pp. : 515-531

Elsevier

Access to resources Recommend Favorite

Minimizing the makespan for the flow shop scheduling problem with availability constraints

By Aggoune R.

European Journal of Operational Research, Vol. 153, Iss. 3, 2004-03 ,pp. : 534-543

Elsevier

Access to resources Recommend Favorite

Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case

By Kats V. Levner E.

European Journal of Operational Research, Vol. 107, Iss. 2, 1998-06 ,pp. : 371-377

Elsevier

Access to resources Recommend Favorite