A cyclic production problem: an application of max-algebra

Author： Nawijn W.M.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.104, Iss.1, 1998-01, pp. : 187-200

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 heuristic algorithm for the mini-max spanning forest problem

By Yamada T.   Takahashi H.   Kataoka S.  

European Journal of Operational Research, Vol. 91, Iss. 3, 1996-06 ,pp. : 565-572

Elsevier

Access to resources Recommend Favorite

Note on cyclic sequences in the product rate variation problem

By Bautista J.   Companys R.   Corominas A.  

European Journal of Operational Research, Vol. 124, Iss. 3, 2000-08 ,pp. : 468-477

Elsevier

Access to resources Recommend Favorite

A branch-and-bound algorithm for the mini-max spanning forest problem

By Yamada T.   Takahashi H.   Kataoka S.  

European Journal of Operational Research, Vol. 101, Iss. 1, 1997-08 ,pp. : 93-103

Elsevier

Access to resources Recommend Favorite

A shrunken cyclic inspection schedule for deteriorating production stages

By Rabinowitz G.  

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

Elsevier

Access to resources Recommend Favorite

A dual control problem and application to marketing

By Fruchter G.E.  

European Journal of Operational Research, Vol. 130, Iss. 1, 2001-04 ,pp. : 99-110

Elsevier

Access to resources Recommend Favorite