Scheduling parallel batch processing machines with non-identical job sizes

zbMATH Open1204.90048MaRDI QIDQ3445643FDOQ3445643

Xianzhao Zhang, Zhihui Sun, Mingcheng Liu

Publication date: 12 June 2007

Full work available at URL: http://en.cnki.com.cn/Article_en/CJFDTotal-LYDS200604007.htm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (9)

• Scheduling jobs with normally distributed processing times on parallel machines
• Scheduling a batch processing machine with non-identical job sizes
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
• Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
• Title not available (Why is that?)
• Parallel machine batching and scheduling with deadlines
• Scheduling jobs with sizes and delivery times on identical parallel batch machines
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation

   Recommendations

• Scheduling unrelated parallel batch processing machines with non-identical job sizes 👍 👎
• Parallel-machine batch scheduling with non-identical job sizes 👍 👎
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes 👍 👎
• Scheduling a single batch processing machine with non-identical job sizes 👍 👎
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times 👍 👎

This page was built for publication: Scheduling parallel batch processing machines with non-identical job sizes

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