Scheduling with batching: A review (Q1969826)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Scheduling with batching: A review	scientific article

Statements

scholarly article

0 references

Scheduling with batching: A review (English)

0 references

zbMATH Open document ID

0 references

10.1016/S0377-2217(99)00153-8

0 references

0 references

Mikhail Y. Kovalyov

0 references

European Journal of Operational Research

0 references

publication date

30 January 2001

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

complexity

0 references

approximation

0 references

scheduling

0 references

batching decisions

0 references

dynamic programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

Batching and Scheduling Jobs on Batch and Discrete Processors

0 references

Single facility multi-class job scheduling

0 references

The complexity of one-machine batching problems

0 references

Scheduling a batching machine

0 references

0 references

Batch scheduling with deadlines on parallel machines

0 references

Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs

0 references

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

0 references

A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times

0 references

Approximation algorithms for two-machine flow shop scheduling with batch setup times

0 references

Parallel Machine Scheduling with Batch Setup Times

0 references

One-machine batching and sequencing of multiple-type items

0 references

Single machine scheduling with batch deliveries

0 references

Batch scheduling and common due-date assignment on a single machine

0 references

Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties

0 references

0 references

Optimal Scheduling of Products with Two Subassemblies on a Single Machine

0 references

Batch sizing and job sequencing on a single machine

0 references

Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time

0 references

Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs

0 references

Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs

0 references

Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time

0 references

Batching to Minimize Flow Times on One Machine

0 references

One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective

0 references

Scheduling the production of two-component jobs on a single machine

0 references

Scheduling multi-operation jobs on a single machine

0 references

Batch scheduling to minimize total completion time

0 references

Batch scheduling to minimize maximum lateness

0 references

Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Single facility scheduling with multiple job classes

0 references

Single machine scheduling with batch set-up times to minimize maximum lateness

0 references

Solving a Class Scheduling Problem with a Genetic Algorithm

0 references

Scheduling with batching: Minimizing the weighted number of tardy jobs

0 references

Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

0 references

Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine

0 references

A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour

0 references

Optimal two- and three-stage production schedules with setup times included

0 references

Two-machine shop scheduling problems with batch processing

0 references

Batch scheduling and common due date assignment problem: An NP-hard case

0 references

Batch scheduling with deadlines on parallel machines: an NP-hard case

0 references

Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

0 references

Single facility scheduling with major and minor setups

0 references

0 references

Scheduling with Deadlines and Loss Functions

0 references

On the Complexity of Scheduling with Batch Setup Times

0 references

Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times

0 references

An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

0 references

Scheduling batches with simultaneous job processing for two-machine shop problems

0 references

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

0 references

0 references

Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times

0 references

Batching in single operation manufacturing systems

0 references

A polynomial algorithm for a one machine batching problem

0 references

Heuristics for permutation flow shop scheduling with batch setup times

0 references

0 references

Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions

0 references

The complexity of scheduling job families about a common due date

0 references

Note on “Parallel Machine Scheduling with Batch Setup Times”

0 references

Scheduling Groups of Jobs on a Single Machine

0 references

A New Heuristic for a Single Machine Scheduling Problem with Set-up Times

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1969826

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