Mixed batch scheduling on identical machines (Q2197328)

From MaRDI portal

Revision as of 09:32, 23 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Mixed batch scheduling on identical machines	scientific article

Statements

scholarly article

0 references

Mixed batch scheduling on identical machines (English)

0 references

0 references

0 references

0 references

Journal of Scheduling

0 references

publication date

31 August 2020

0 references

zbMATH Keywords

scheduling

0 references

batch

0 references

algorithm

0 references

complexity

0 references

worst-case performance ratio

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10951-019-00623-9

0 references

The complexity of one-machine batching problems

0 references

A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size

0 references

Batching identical jobs

0 references

Batch scheduling of step deteriorating jobs

0 references

Scheduling a batching machine

0 references

Minimizing total completion time on a batch processing machine with job families

0 references

Batch sizing and job sequencing on a single machine

0 references

Batch-processing scheduling with setup times

0 references

A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING

0 references

Unbounded parallel-batch scheduling with drop-line tasks

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Bounded serial-batching scheduling for minimizing maximum lateness and makespan

0 references

Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

0 references

Efficient scheduling algorithms for a single batch processing machine

0 references

Two-agent scheduling with agent specific batches on an unbounded serial batching machine

0 references

Minimizing makespan on a single batch processing machine with dynamic job arrivals

0 references

Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

0 references

Serial batch scheduling on uniform parallel machines to minimize total completion time

0 references

On the complexity of bi-criteria scheduling on a single batch processing machine

0 references

Cost allocation in rescheduling with machine unavailable period

0 references

Rescheduling for machine disruption to minimize makespan and maximum lateness

0 references

Batch scheduling with deteriorating jobs to minimize the total completion time

0 references

A coordination mechanism for a scheduling game with parallel-batching machines

0 references

ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING

0 references

Scheduling with batching: A review

0 references

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

0 references

The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost

0 references

A review of planning and scheduling systems and methods for integrated steel production

0 references

Scheduling a single batch processing machine with non-identical job sizes

0 references

Scheduling batch processing machines with incompatible job families

0 references

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

0 references

Scheduling Groups of Jobs on a Single Machine

0 references

Minimizing makespan on a single batch processing machine with nonidentical job sizes

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10951-019-00623-9

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2197328

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2197328&oldid=36613102"