Single machine scheduling under market uncertainty

DOI10.1016/j.ejor.2005.09.047zbMath1111.90047OpenAlexW2017453254MaRDI QIDQ856210

Joseph G. Szmerekovsky

Publication date: 7 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.047

zbMATH Keywords

heuristicsschedulingstochastic processesbranch and boundcomplexity theory

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Stochastic models in economics (91B70)

Related Items (3)

Scheduling multi-mode projects under uncertainty to optimize cash flows: a Monte Carlo ant colony system approach ⋮ Scheduling jobs on a single machine to maximize the total revenue of jobs ⋮ Real options in operations research: a review

Cites Work

• Unnamed Item
• Unnamed Item
• Valuing fixed price supply contracts
• Single machine scheduling with nonlinear cost functions
• Optimal Operating Policies for Multiplant Stochastic Manufacturing Systems in a Changing Environment
• A Dynamic Programming Approach to Sequencing Problems
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• Contingent Claims Contracting for Purchasing Decisions in Inventory Management
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
• Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows
• Maximizing the net present value of a project with linear time-dependent cash flows
• Scheduling with Random Service Times

This page was built for publication: Single machine scheduling under market uncertainty