Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems

INFORMS Journal on Computing - United States
doi 10.1287/ijoc.1040.0069
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Optimal Mechanisms for Single Machine Scheduling

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Matching Based Very Large-Scale Neighborhoods for Parallel Machine Scheduling

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2010English

Single-Machine Group Scheduling Problems With Variable Job Processing Times

Mathematical Problems in Engineering
MathematicsEngineering
2015English

Single Machine Earliness-Tardiness Scheduling Problems Using the Equal—Slack Rule

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

Single Machine Scheduling Problems With General Breakdowns, Earliness and Tardiness Costs

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1997English

Adaptive Problem-Solving for Large-Scale Scheduling Problems: A Case Study

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Using Stochastic Dual Dynamic Programming in Problems With Multiple Near-Optimal Solutions

Water Resources Research
Water ScienceTechnology
2016English

Single-Machine Scheduling Problems With a Sum-Of-Processing-Time-Based Learning Function

International Journal of Combinatorics
2009English

Solving Large-Scale Resource Allocation Problems : Formulations, Solutions and Case Studies

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy