scientific article; zbMATH DE number 5222189
From MaRDI portal
Publication:5431779
zbMath1169.90356MaRDI QIDQ5431779
Publication date: 25 December 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (21)
Time slot scheduling of compatible jobs ⋮ Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs ⋮ An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities ⋮ No-Wait Scheduling Problems with Batching Machines ⋮ Exact weighted vertex coloring via branch-and-price ⋮ Bounded max-colorings of graphs ⋮ A survey on vertex coloring problems ⋮ Flowshop scheduling problem with a batching machine and task compatibilities ⋮ Batch processing with interval graph compatibilities between tasks ⋮ A hypocoloring model for batch scheduling ⋮ Unnamed Item ⋮ Scheduling hybrid flowshop with parallel batching machines and compatibilities ⋮ A note on minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ Scheduling an unbounded batching machine with job processing time compatibilities ⋮ Models and heuristic algorithms for a weighted vertex coloring problem ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Scheduling incompatible tasks on two machines ⋮ Weighted coloring: further complexity and approximability results ⋮ Clique partitioning with value-monotone submodular cost ⋮ Single-machine batch scheduling with job processing time compatibility ⋮ Scheduling on a batch processing machine with split compatibility graphs
This page was built for publication:
