Minimum Makespan Scheduling With Low Rank Processing Times

doi 10.1137/1.9781611973105.67
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Single Machine Scheduling With Resource Dependent Release Times and Processing Times

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

Single-Machine Group Scheduling Problems With Variable Job Processing Times

Mathematical Problems in Engineering
MathematicsEngineering
2015English

Continuous Logic and Scheduling in Systems With Indeterminate Processing Times

Studia Humana
2014English

Single Machine Scheduling With Controllable Processing Times by Submodular Optimization

International Journal of Foundations of Computer Science
Computer Science
2009English

Scheduling With Discretely Compressible Release Dates to Minimize Makespan

Asia-Pacific Journal of Operational Research
Management ScienceOperations Research
2010English

LS Algorithm for Semi-Online Scheduling Jobs With Nondecreasing Release Times and Nondecreasing Processing Times

2015English

Flexible Flow Shop Scheduling With Stochastic Processing Times: A Decomposition-Based Approach

Computers and Industrial Engineering
EngineeringComputer Science
2012English

Parallel Machine Scheduling With Nested Processing Set Restrictions and Job Delivery Times

Mathematical Problems in Engineering
MathematicsEngineering
2016English

Scheduling the Arrivals in a No-Wait Flowshop With Fuzzy Processing Times

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy