Single–machine scheduling with random machine breakdowns and randomly compressible processing times (Q4495504): Difference between revisions

Latest revision as of 23:51, 11 June 2024

scientific article; zbMATH DE number 1488611

Language	Label	Description	Also known as
English	Single–machine scheduling with random machine breakdowns and randomly compressible processing times	scientific article; zbMATH DE number 1488611

Statements

instance of

scholarly article

0 references

title

Single–machine scheduling with random machine breakdowns and randomly compressible processing times (English)

0 references

zbMATH Open document ID

0973.90035

0 references

DOI

10.1080/07362990008809689

0 references

published in

Stochastic Analysis and Applications

0 references

publication date

10 August 2000

0 references

Mathematics Subject Classification ID

0 references

0 references

scheduling

0 references

unreliable machine

0 references

random compression

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/07362990008809689

0 references

OpenAlex ID

W2040003783

0 references

cites work

Two parallel machine sequencing problems involving controllable job processing times

0 references

The single-machine absolute-deviation early-tardy problem with random completion times

0 references

Single-machine scheduling subject to stochastic breakdowns

0 references

Bounds on optimal values in stochastic scheduling

0 references

Introduction to Stochastic Programming

0 references

Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties

0 references

Scheduling to minimize the total compression and late costs

0 references

Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy

0 references

Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties

0 references

A two-machine flow shop scheduling problem with controllable job processing times

0 references

A survey of results for sequencing problems with controllable processing times

0 references

Single-machine sequencing with controllable processing times

0 references

A bicriterion approach to time/cost trade-offs in sequencing

0 references

Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine

0 references

Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis

0 references

Wikidata QID

Q126240484

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4495504

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/07362990008809689
+Normal rank
@@ Property / OpenAlex ID @@
+W2040003783
@@ Property / OpenAlex ID: W2040003783 / rank @@
+Normal rank
@@ Property / cites work @@
+Two parallel machine sequencing problems involving controllable job processing times
+Normal rank
@@ Property / cites work @@
+The single-machine absolute-deviation early-tardy problem with random completion times
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling subject to stochastic breakdowns
+Normal rank
@@ Property / cites work @@
+Bounds on optimal values in stochastic scheduling
@@ Property / cites work: Bounds on optimal values in stochastic scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to Stochastic Programming
@@ Property / cites work: Introduction to Stochastic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
+Normal rank
@@ Property / cites work @@
+Scheduling to minimize the total compression and late costs
+Normal rank
@@ Property / cites work @@
+Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
+Normal rank
@@ Property / cites work @@
+Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
+Normal rank
@@ Property / cites work @@
+A two-machine flow shop scheduling problem with controllable job processing times
+Normal rank
@@ Property / cites work @@
+A survey of results for sequencing problems with controllable processing times
+Normal rank
@@ Property / cites work @@
+Single-machine sequencing with controllable processing times
+Normal rank
@@ Property / cites work @@
+A bicriterion approach to time/cost trade-offs in sequencing
+Normal rank
@@ Property / cites work @@
+Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
+Normal rank
@@ Property / cites work @@
+Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
+Normal rank
@@ Property / Wikidata QID @@
+Q126240484
@@ Property / Wikidata QID: Q126240484 / rank @@
+Normal rank