Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
type: Item
instance of: scholarly article
title: Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
zbMATH Open document ID: 1380.90123
author: Shu-Guang Li
published in: European Journal of Operational Research
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6835078
zbMATH Keywords: scheduling
zbMATH Keywords: batch machines
zbMATH Keywords: job sizes
zbMATH Keywords: non-identical capacities
zbMATH Keywords: makespan
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.06.021
OpenAlex ID: W2621871100
cites work: Improved Algorithms for Bipartite Network Flow
cites work: Q3425131
cites work: Scheduling a batching machine
cites work: Q3002852
cites work: Q3651735
cites work: Approximation algorithms for the multiple knapsack problem with assignment restrictions
cites work: A PTAS for semiconductor burn-in scheduling
cites work: Approximation algorithms in batch processing
cites work: Q2957914
cites work: Improved bounds for batch scheduling with nonidentical job sizes
cites work: Q4198056
cites work: Parallel machine scheduling with job assignment restrictions
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Parallel machine scheduling under a grade of service provision
cites work: Task Scheduling on a Multiprocessor System with Independent Memories
cites work: Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Scheduling parallel machines with inclusive processing set restrictions and job release times
cites work: Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
cites work: Minimizing makespan on a single batching machine with release times and non-identical job sizes
cites work: Minimizing makespan with release times on identical parallel batching machines
cites work: Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
cites work: Scheduling one batch processor subject to job release dates
cites work: A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
cites work: Scheduling parallel machines with inclusive processing set restrictions
cites work: Q4217266
cites work: Scheduling with batching: A review
cites work: An optimal rounding gives a better approximation for scheduling unrelated machines
cites work: Q4290987
cites work: Scheduling a single batch processing machine with non-identical job sizes
cites work: Scheduling batch processing machines with incompatible job families
cites work: Minimizing makespan on a single batch processing machine with nonidentical job sizes
DOI: 10.1016/J.EJOR.2017.06.021
description: scientific article; zbMATH DE number 6835078