Bicriterion scheduling with equal processing times on a batch processing machine

DOI10.1016/j.cor.2007.07.007zbMath1163.90497OpenAlexW2030642542MaRDI QIDQ947947

B. E. Eshmatov

Publication date: 8 October 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/1302

zbMATH Keywords

schedulingbatch processing machinebicriterion

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives ⋮ A note on batch scheduling on a two-machine flowshop with machine-dependent processing times ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Parallel machine problems with equal processing times: a survey ⋮ An improved genetic algorithm for single-machine inverse scheduling problem ⋮ Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties ⋮ SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION ⋮ A survey of scheduling with parallel batch (p-batch) processing

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient scheduling algorithms for a single batch processing machine
• Multiple and bicriteria scheduling: A literature survey
• Scheduling a batching machine
• Complexity of single machine, multi-criteria scheduling problems
• Batching identical jobs
• Scheduling unit processing time jobs on a single machine with multiple criteria
• Minimizing flowtime and missed due-dates in single-machine sequencing
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Bicriterion scheduling with equal processing times on a batch processing machine