Minimizing total weighted tardiness on a single batch process machine with incompatible job families
type: Item
instance of: scholarly article
title: Minimizing total weighted tardiness on a single batch process machine with incompatible job families
zbMATH Open document ID: 1073.90015
DOI: 10.1016/S0305-0548(03)00239-9
author: Imelda C. Perez
author: John Fowler
author: W. Matthew Carlyle
published in: Computers \& Operations Research
publication date: 2004-11-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B90
zbMATH DE Number: 2115342
MaRDI profile type: Publication
cites work: Q4124332
cites work: Q3525910
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Scheduling a single batch processing machine with non-identical job sizes
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: Batching and Scheduling Jobs on Batch and Discrete Processors
cites work: Towards a knowledge-based scheduling system for semiconductor testing
cites work: Heuristic scheduling of jobs on a multi-product batch processing machine
cites work: Scheduling batch processing machines with incompatible job families
cites work: Batching and Scheduling in FMS Hubs: Flow Time Considerations
cites work: Minimizing total completion time on a batch processing machine with job families
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: Scheduling batches on parallel machines with major and minor set-ups
cites work: The Batch Loading and Scheduling Problem
cites work: Scheduling with agreeable release times and due dates on a batch processing machine
cites work: Scheduling with batching: Minimizing the weighted number of tardy jobs
cites work: Stochastic scheduling of a batch processing machine with incompatible job families
cites work: Dominance and Decomposition Heuristics for Single Machine Scheduling
full work available at URL: s0305-0548(03)00239-9
OpenAlex ID: W1963645413
description: scientific article; zbMATH DE number 2115342