Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time
type: Item
instance of: scholarly article
title: Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time
zbMATH Open document ID: 1382.90039
author: Jun Pei
author: Panos M. Pardalos
author: Kai Li
author: Wenjuan Fan
author: Athanasios Migdalas
author: Xinbao Liu
published in: Optimization Letters
publication date: 2017-11-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6804648
zbMATH Keywords: scheduling
zbMATH Keywords: availability constraint
zbMATH Keywords: serial-batching
zbMATH Keywords: single-machine
zbMATH Keywords: position-dependent processing time
MaRDI profile type: Publication
full work available at URL: s11590-016-1074-9
OpenAlex ID: W2520498410
cites work: Single-machine scheduling with learning considerations
cites work: Single machine scheduling with learning effect considerations
cites work: Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects
cites work: Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning
cites work: Scheduling with a position-weighted learning effect
cites work: Flowshop scheduling with a general exponential learning effect
cites work: A simple proof technique for scheduling models with learning effects
cites work: Machine scheduling with an availability constraint
cites work: Two-machine flowshop scheduling with availability constraints
cites work: Order acceptance and scheduling with machine availability constraints
cites work: Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
cites work: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
cites work: Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
cites work: Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
cites work: Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine
cites work: Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
cites work: Single-machine group scheduling with general deterioration and learning effects
cites work: Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
cites work: Flow-shop scheduling with a learning effect
cites work: Scheduling a hybrid flowshop with batch production at the last stage
cites work: Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
cites work: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
cites work: Complexity and approximability of scheduling resumable proportionally deteriorating jobs
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
DOI: 10.1007/S11590-016-1074-9
description: scientific article; zbMATH DE number 6804648