A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761): Difference between revisions

Latest revision as of 13:44, 9 December 2024

scientific article

Language	Label	Description	Also known as
English	A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization	scientific article

Statements

instance of

scholarly article

0 references

title

A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (English)

0 references

0 references

0 references

0 references

Atidel Ben Hadj-Alouane

0 references

published in

Applied Mathematics and Computation

0 references

publication date

21 June 2016

0 references

zbMATH Keywords

scheduling

0 references

single machine

0 references

maximum delivery time

0 references

non-availability constraint

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.amc.2014.11.103

0 references

cites work

Single machine flow-time scheduling with a single breakdown

0 references

The one-machine sequencing problem

0 references

Some simple scheduling algorithms

0 references

Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval

0 references

Approximation algorithms for single machine scheduling with one unavailability period

0 references

Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval

0 references

On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

0 references

New single machine and job-shop scheduling problems with availability constraints

0 references

Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times

0 references

Scheduling with limited machine availability

0 references

SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES

0 references

Identifiers

zbMATH Open document ID

1338.90166

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.AMC.2014.11.103

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:298761

@@ Property / DOI @@
-.1016/j.amc.2014.11.103
@@ Property / DOI: 10.1016/j.amc.2014.11.103 / rank @@
-Normal rank
@@ Property / author @@
-Q298760
@@ Property / author: Q298760 / rank @@
-Normal rank
@@ Property / author @@
+Atidel Ben Hadj-Alouane
@@ Property / author: Atidel Ben Hadj-Alouane / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C57
@@ Property / Mathematics Subject Classification ID: 90C57 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6595835
@@ Property / zbMATH DE Number: 6595835 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling
@@ Property / zbMATH Keywords: scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+single machine
@@ Property / zbMATH Keywords: single machine / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximum delivery time
@@ Property / zbMATH Keywords: maximum delivery time / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+non-availability constraint
@@ Property / zbMATH Keywords: non-availability constraint / rank @@
+Normal rank
@@ 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.1016/j.amc.2014.11.103
+Normal rank
@@ Property / OpenAlex ID @@
+W1967768830
@@ Property / OpenAlex ID: W1967768830 / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine flow-time scheduling with a single breakdown
+Normal rank
@@ Property / cites work @@
+The one-machine sequencing problem
@@ Property / cites work: The one-machine sequencing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Some simple scheduling algorithms
@@ Property / cites work: Some simple scheduling algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for single machine scheduling with one unavailability period
+Normal rank
@@ Property / cites work @@
+Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval
+Normal rank
@@ Property / cites work @@
+On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
+Normal rank
@@ Property / cites work @@
+New single machine and job-shop scheduling problems with availability constraints
+Normal rank
@@ Property / cites work @@
+Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
+Normal rank
@@ Property / cites work @@
+Scheduling with limited machine availability
@@ Property / cites work: Scheduling with limited machine availability / rank @@
+Normal rank
@@ Property / cites work @@
+SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
+Normal rank
@@ Property / DOI @@
+.1016/J.AMC.2014.11.103
@@ Property / DOI: 10.1016/J.AMC.2014.11.103 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:298761