Job selection and sequencing on a single machine in a random environment
type: Item
instance of: scholarly article
title: Job selection and sequencing on a single machine in a random environment
zbMATH Open document ID: 0782.90049
DOI: 10.1016/0377-2217(93)90252-I
author: Prabuddha De
author: Jay B. Ghosh
author: Charles Wells
published in: European Journal of Operational Research
publication date: 1993-12-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 93E03
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 474854
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: single machine scheduling
zbMATH Keywords: random processing times
zbMATH Keywords: deadline
zbMATH Keywords: \(NP\)-hard
zbMATH Keywords: pseudo-polynomial time worst-case complexity
MaRDI profile type: Publication
cites work: N-Job, One Machine Sequencing Problems Under Uncertainty
cites work: Minimizing the expected weighted number of tardy jobs in stochastic flow shops
cites work: On the minimization of the weighted number of tardy jobs with random processing times and deadline
cites work: Q4198056
cites work: Q3959421
cites work: On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs
cites work: Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: Q3885184
cites work: Optimal strategies for a class of constrained sequential problems
cites work: Stochastic Scheduling with Release Dates and Due Dates
cites work: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
full work available at URL: 0377-2217(93)90252-i
OpenAlex ID: W2045642420
description: scientific article; zbMATH DE number 474854