Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types

DOI10.1007/s10472-015-9449-7zbMath1338.90181OpenAlexW2069314177WikidataQ57433268 ScholiaQ57433268MaRDI QIDQ276548

Wenjuan Fan, Panos M. Pardalos, Athanasios Migdalas, Jun Pei, Shan-Lin Yang, Xin-Bao Liu

Publication date: 4 May 2016

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-015-9449-7

zbMATH Keywords

single machinesetup timedynamic job arrivalmultiple job typesserial-batching scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration ⋮ Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine

Cites Work

• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
• Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
• An iterative approach for the serial batching problem with parallel machines and job families
• A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
• Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
• Single-machine scheduling with stepwise tardiness costs and release times
• Scheduling job families on non-identical parallel machines with time constraints
• On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
• Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
• Evolutionary computation in combinatorial optimization. 6th European conference, EvoCOP 2006, Budapest, Hungary, April 10--12, 2006. Proceedings
• A \(2.28\)-competitive algorithm for online scheduling on identical machines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Exact algorithms for scheduling multiple families of jobs on parallel machines

This page was built for publication: Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types