Job selection and sequencing on a single machine in a random environment

DOI10.1016/0377-2217(93)90252-IzbMath0782.90049OpenAlexW2045642420MaRDI QIDQ1310027

Prabuddha De, Charles E. Wells, Jay B. Ghosh

Publication date: 20 December 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90252-i

zbMATH Keywords

stochastic schedulingrandom processing timessingle machine schedulingdeadline\(NP\)-hardpseudo-polynomial time worst-case complexity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Stochastic systems in control theory (general) (93E03)

Related Items (9)

Multi-period job selection: Planning work loads to maximize profit ⋮ Job selection in a heavily loaded shop ⋮ Selecting jobs for scheduling on a machine subject to failure ⋮ Order acceptance with weighted tardiness ⋮ Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space ⋮ Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Order acceptance using genetic algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• On the minimization of the weighted number of tardy jobs with random processing times and deadline
• Optimal strategies for a class of constrained sequential problems
• A Dynamic Programming Approach to Sequencing Problems
• Stochastic Scheduling with Release Dates and Due Dates
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs
• Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
• N-Job, One Machine Sequencing Problems Under Uncertainty

This page was built for publication: Job selection and sequencing on a single machine in a random environment