Minimizing Makespan and Preemption Costs on a System of Uniform Machines

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45749-6_74
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Flow Shop Scheduling Problem With Four Machines N-Job for Minimizing Makespan

International Journal of Engineering Research and
2017English

Minimizing Worst-Case and Average-Case Makespan Over Scenarios

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2016English

Minimizing Energy Consumption and Makespan in a Two-Machine Flowshop Scheduling Problem

Journal of the Operational Research Society
ManagementProbabilityMarketingUncertaintySimulationManagement ScienceStatisticsManagement Information SystemsModelingStrategyOperations Research
2016English

Minimizing Expected Makespans on Uniform Processor Systems

Advances in Applied Probability
Applied MathematicsStatisticsProbability
1987English

Heuristic Procedures for Minimizing Makespan and the Number of Required Pallets

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
1995English

Hierarchy-Based Algorithms for Minimizing Makespan Under Precedence and Communication Constraints

2020English

Optimal On-Line Algorithms to Minimize Makespan on Two Machines With Resource Augmentation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Memetic Algorithm for Minimizing the Makespan in the Job Shop Scheduling Problem

Revista Facultad de Ingeniería
2017English

Erratum To: Minimizing Total Tardiness on Parallel Machines With Preemptions

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy