Fast Computational Procedure for Solving Multi-Item Single-Machine Lot Scheduling Optimization Problems

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.93, Iss.3, 1997-06, pp. : 491-515

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

On equivalence between the proportionate flow shop and single‐machine scheduling problems

Naval Research Logistics: An International Journal, Vol. 62, Iss. 7, 2015-10 ,pp. : 595-603

John Wiley & Sons Inc

Access to resources Recommend Favorite

Single machine scheduling problems with subcontracting options

By Zhong Weiya Huo Zhiming

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 489-498

Springer Publishing Company

Access to resources Recommend Favorite

Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

By Hoogeveen J.A.

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 415-433

Academic Press

Access to resources Recommend Favorite

Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem

By Pimentel Carina Maria Oliveira Alvelos Filipe Pereira Valerio de Carvalho Jose

Optimization Methods and Software, Vol. 25, Iss. 2, 2010-04 ,pp. : 299-319

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems

By Frangioni Antonio Necciari Emiliano Scutellà Maria Grazia

Journal of Combinatorial Optimization, Vol. 8, Iss. 2, 2004-06 ,pp. : 195-220

Springer Publishing Company

Access to resources Recommend Favorite