Amanote Research
Register
Sign In
LS Algorithm for Semi-Online Scheduling Jobs With Nondecreasing Release Times and Nondecreasing Processing Times
doi 10.2991/cisia-15.2015.155
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2015
Authors
F. Tang
J. Nie
Publisher
Atlantis Press
Related search
Single Machine Scheduling With Resource Dependent Release Times and Processing Times
European Journal of Operational Research
Information Systems
Simulation
Management Science
Management
Computer Science
Modeling
Operations Research
Fast Scheduling of Weighted Unit Jobs With Release Times and Deadlines
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Bounding Completion Times of Jobs With Arbitrary Release Times and Variable Execution Times
Technical Note—Single Machine Scheduling With Controllable Processing Times and Number of Jobs Tardy
Operations Research
Management Science
Computer Science Applications
Operations Research
Scheduling Jobs With Stochastically Ordered Processing Times on Parallel Machines to Minimize Expected Flowtime
Journal of Applied Probability
Mathematics
Statistics
Uncertainty
Probability
Two Processor Scheduling With Real Release Times and Deadlines
Minimum Makespan Scheduling With Low Rank Processing Times
Scheduling a Batch-Processing Machine Subject to Precedence Constraints, Release Dates and Identical Processing Times
Computers and Operations Research
Management Science
Simulation
Computer Science
Operations Research
Modeling
Continuous Logic and Scheduling in Systems With Indeterminate Processing Times
Studia Humana
