International Journal of Computer Integrated Manufacturing · 1992 · 18 citations · 10 references
EngineeringIndustrial EngineeringManufacturing EngineeringComputer-integrated ManufacturingOptimizationProduction PlanningInteger ProgrammingJob SequencingMachine SchedulingProduction Planning SystemsProduction SchedulingScheduling TheoryCustomer Order ProcessingDispatchingDispatching AlgorithmsGroup TechnologyJust-in-time ManufacturingManufacturing System ModelsMathematical Programming ModelsMixed-integer Programming
Abstract. Abstract. A model is presented to select from among a range of customer orders, those orders which will maximize the net operational profit during the planning time horizon. The proposed model is developed based on group technology (GT) and just-in-time (JIT) concepts. The proposed model can be used simultaneously as a loading model for optimal use of the processing capabilities of an integrated manufacturing system consisting of a set of non-identical GT cells. In this model, the planning time horizon is assumed to be short; the production quantity of each customer order for any part or product always equals its corresponding demand quantity (e.g., JIT philosophy); each part requires a finite number of aggregated stages of operation; job splitting is allowed; and the processing priorities of all the jobs during the planning time horizon are specified, based on a desirable dispatching rule. This mathematical programming model is a fixed charge problem which is solved by a compatible mixed integer programming algorithm.
10
Lecture Notes in Economics and Mathematical Systems
Robert J. Weiner · Journal of Policy Analysis and Management · 1985 · 1.3K citations · Full text
Cross decomposition for mixed integer programming
Tony J. Van Roy · Mathematical Programming · 1983 · 162 citations
Cross decomposition for mixed integer programming
van Roy, J Â Tony · RePEc: Research Papers in Economics · 1983 · 130 citations