Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392): Difference between revisions

Latest revision as of 07:43, 12 July 2024

scientific article

Language	Label	Description	Also known as
English	Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval	scientific article

Statements

instance of

scholarly article

0 references

title

Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (English)

0 references

zbMATH Open document ID

1341.90059

0 references

DOI

10.1016/j.ins.2014.02.142

0 references

0 references

0 references

0 references

0 references

8 July 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

scheduling

0 references

batch delivery

0 references

fully polynomial-time approximation scheme

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ins.2014.02.142

0 references

OpenAlex ID

W1967309777

0 references

cites work

Single machine flow-time scheduling with a single breakdown

0 references

Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint

0 references

Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs

0 references

Minimizing total flow time in the single-machine scheduling problem with periodic maintenance

0 references

Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time

0 references

Batch sizing and job sequencing on a single machine

0 references

Batch Delivery Scheduling on a Single Machine

0 references

Single machine scheduling with batch deliveries

0 references

Q4284154

0 references

Scheduling deteriorating jobs subject to job or machine availability constraints

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Supply Chain Scheduling: Batching and Delivery

0 references

On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date

0 references

A single-machine scheduling problem with maintenance activities to minimize makespan

0 references

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

0 references

Batch delivery scheduling with batch delivery cost on a single machine

0 references

Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period

0 references

Improving the complexities of approximation algorithms for optimization problems

0 references

Single machine flow-time scheduling with scheduled maintenance

0 references

Single-machine scheduling with periodic maintenance and nonresumable jobs.

0 references

Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance

0 references

Scheduling with batching: A review

0 references

Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity

0 references

An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints

0 references

Algorithms for Scheduling Independent Tasks

0 references

Single machine batch scheduling with release times and delivery costs

0 references

Single machine batch scheduling to minimize total completion time and resource consumption costs

0 references

Scheduling Groups of Jobs on a Single Machine

0 references

A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:726392

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ins.2014.02.142
+Normal rank
@@ Property / OpenAlex ID @@
+W1967309777
@@ Property / OpenAlex ID: W1967309777 / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine flow-time scheduling with a single breakdown
+Normal rank
@@ Property / cites work @@
+Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
+Normal rank
@@ Property / cites work @@
+Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
+Normal rank
@@ Property / cites work @@
+Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
+Normal rank
@@ Property / cites work @@
+Batch sizing and job sequencing on a single machine
+Normal rank
@@ Property / cites work @@
+Batch Delivery Scheduling on a Single Machine
@@ Property / cites work: Batch Delivery Scheduling on a Single Machine / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine scheduling with batch deliveries
@@ Property / cites work: Single machine scheduling with batch deliveries / rank @@
+Normal rank
@@ Property / cites work @@
+Q4284154
@@ Property / cites work: Q4284154 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling deteriorating jobs subject to job or machine availability constraints
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Supply Chain Scheduling: Batching and Delivery
@@ Property / cites work: Supply Chain Scheduling: Batching and Delivery / rank @@
+Normal rank
@@ Property / cites work @@
+On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
+Normal rank
@@ Property / cites work @@
+A single-machine scheduling problem with maintenance activities to minimize makespan
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Batch delivery scheduling with batch delivery cost on a single machine
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
+Normal rank
@@ Property / cites work @@
+Improving the complexities of approximation algorithms for optimization problems
+Normal rank
@@ Property / cites work @@
+Single machine flow-time scheduling with scheduled maintenance
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with periodic maintenance and nonresumable jobs.
+Normal rank
@@ Property / cites work @@
+Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
+Normal rank
@@ Property / cites work @@
+Scheduling with batching: A review
@@ Property / cites work: Scheduling with batching: A review / rank @@
+Normal rank
@@ Property / cites work @@
+Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
+Normal rank
@@ Property / cites work @@
+Algorithms for Scheduling Independent Tasks
@@ Property / cites work: Algorithms for Scheduling Independent Tasks / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine batch scheduling with release times and delivery costs
+Normal rank
@@ Property / cites work @@
+Single machine batch scheduling to minimize total completion time and resource consumption costs
+Normal rank
@@ Property / cites work @@
+Scheduling Groups of Jobs on a Single Machine
@@ Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
+Normal rank