Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine

Cites Work

Title not available (Why is that?)
Lot scheduling on a single machine
Scheduling open shops with parallel machines to minimize total completion time
Experimental study of scheduling with memory constraints using hybrid methods
Batching in single operation manufacturing systems
Bicriterion scheduling of identical processing time jobs by uniform processors
Scheduling a batching machine
Single machine lot scheduling to minimize the total weighted (discounted) completion time
A note on a single-machine lot scheduling problem with indivisible orders
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
Scheduling with batching: A review
Single machine batch scheduling with two non-disjoint agents and splitable jobs
Single machine lot scheduling with optional job-rejection
Single machine lot scheduling with non-uniform lot capacities and processing times
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities
A note on the single machine CON and CONW problems with lot scheduling
Bicriteria scheduling of equal length jobs on uniform parallel machines
Scheduling two agents on uniform parallel machines with~makespan and cost functions
Multicriteria scheduling
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
Scheduling identical jobs on uniform parallel machines
Scheduling Problems with Two Competing Agents
Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
A note on lot scheduling on a single machine to minimize maximum weighted tardiness

This page was built for publication: Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6664884)