Heuristic Procedures for Minimizing Makespan and the Number of Required Pallets

European Journal of Operational Research - Netherlands
doi 10.1016/0377-2217(94)00059-l
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

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

2020English

Minimizing Worst-Case and Average-Case Makespan Over Scenarios

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2016English

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

Revista Facultad de Ingeniería
2017English

Number of Procedures Required to Start a Business (2008-18)

SME Policy Index
2019English

Minimizing Makespan and Preemption Costs on a System of Uniform Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

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

International Journal of Engineering Research and
2017English

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

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

Exact and Heuristic Methods for Minimizing the Total Completion Time in Job-Shops

Studies in Informatics and Control
Electronic EngineeringElectricalComputer Science
2014English

Minimizing the Condition Number for Small Rank Modifications

SIAM Journal on Matrix Analysis and Applications
Analysis
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy