Operational Operations Research at the Mathematical Centre
Article Abstract:
Consulting in operations research at the Mathematical Centre in Amsterdam is reviewed. The activities of the Department of Operations Research and System Theories are highlighted, as are three practical projects of the Mathematical Centre (MC). MC was founded in 1946, as a non-profit institution promoting mathematics in the areas of pure mathematics, applied and numerical mathematics, mathematical statistics, operations research, system theory and computer science. It is backed by the government through the Netherlands Organization for the Advancement of Pure Research. It also engages in public and private consulting activities. The 1980 budget was funded by the government for eighty-five per cent. About one hundred and fifty persons are employed by MC. Current research projects focus on combinatorial optimization, analysis and control of information flow, and system and control theory. A public transportation problem is featured.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1984
User Contributions:
Comment about this article or add new information about this topic:
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
Article Abstract:
Preemptive scheduling in a two-stage flow shop with at least two identical parallel machines in one of the stages to minimize makespan is NP-hard in the strong sense. Johnson's efficient algorithm presented in 1954 for minimizing makespan in two-machine flow shop cannot be used for preemptive scheduling. McNaughton's wrap-around rule presented in 1959 calculates the shortest preemptive schedule on identical parallel machines in linear time but there is no similarly effective algorithm for the simplest common generalization of the problem.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Linear programming models with planned lead times for supply chain operations planning
Article Abstract:
A linear-programming model for capacity constrained Supply Chain Operations Planning is developed using planned lead times.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: On the connections among activity-based costing, mathematical programming models for analyzing strategic decisions, and the resource-based view of the firm
- Abstracts: Minimizing deviations from the group mean: a new linear programming approach for the two-group classification problem
- Abstracts: A hybrid heuristic and linear programming approach to multi-product machine scheduling. An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Abstracts: The Spanish market for vitamins & dietary supplements. The German market for slimming and supplementary nutrition
- Abstracts: Mining the Information Channel. Some of the UK's biggest companies are now using a system which streamlines project management and data sharing