A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Journal of Scheduling

• Publication date

  2009-12-31

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10951-009-0154-4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A best online algorithm for scheduling on two parallel batch machines

  2009cited by this paper
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

  2008cited by this paper
• A Single Batch Processing Machine with Nonidentical Job Sizes and Precedence constraints

  2006cited by this paper
• Minimizing makespan on a single batching machine with release times and non-identical job sizes

  2005cited by this paper
• The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan

  2004cited by this paper
• Single machine parallel batch scheduling subject to precedence constraints

  2004cited by this paper
• On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time

  2004cited by this paper
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

  2004cited by this paper
• Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs

  2003cited by this paper
• The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard

  2003cited by this paper
• Optimal on-line algorithms for scheduling on parallel batch processing machines

  2003cited by this paper
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

  2002cited by this paper
• On‐line algorithms for minimizing makespan on batch processing machines

  2001cited by this paper
• Scheduling one batch processor subject to job release dates

  2000cited by this paper
• Minimizing makespan on a single batch processing machine with dynamic job arrivals

  1999cited by this paper
• Scheduling a batching machine

  1998cited by this paper
• Scheduling a single batch processing machine with non-identical job sizes

  1994cited by this paper
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

  1992cited by this paper
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

  1977cited by this paper

• The online-scheduling problems with the bounded batch and incompatible job families on the unit flowshop machines

  2025cites this paper
• A Best Possible Algorithm for Online Unbounded Batch Scheduling with Two Incompatible Families to Minimize Maximum Flow Time

  2025cites this paper
• Online Scheduling on a Parallel‐Batch Machine With Pulse Interruptions

  2025cites this paper
• Optimal algorithms for online batch scheduling with all possible equal-processing times under periodic pulse interruptions

  2025cites this paper
• Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan

  2024cites this paper
• A Three-Stage model for Clustering, Storage, and joint online order batching and picker routing Problems: Heuristic algorithms

  2023cites this paper
• A Best Possible Online Algorithm For Parallel-Batch Scheduling with Kind Release Times and Job Compatibilities

  2023cites this paper
• Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions

  2023cites this paper
• Online scheduling on parallel-batching machines with periodic availability constraints and job delivery

  2022cites this paper
• Research on the parallel–batch scheduling with linearly lookahead model

  2020cites this paper
• The medical laboratory scheduling for weighted flow-time

  2019cites this paper
• On-line scheduling with equal-length jobs on parallel-batch machines to minimise maximum flow-time with delivery times

  2019cites this paper
• The online integrated order picking and delivery considering Pickers’ learning effects for an O2O community supermarket

  2019cites this paper
• Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead

  2019cites this paper
• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine

  2019cites this paper
• Online Bi-Criteria Scheduling on Batch Machines with Machine Costs

  2019cites this paper
• Online scheduling of jobs with kind release times and deadlines on a single machine

  2019cites this paper
• Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan

  2018cites this paper
• A best possible on-line algorithm for scheduling on uniform parallel-batch machines

  2018cites this paper
• Online Scheduling on Bounded Batch Machines to Minimize the Maximum Weighted Completion Time

  2017cites this paper
• Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs

  2017cites this paper
• An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities

  2017cites this paper
• The medical laboratory scheduling for weighted flow-time

  2017cites this paper
• Online batch scheduling with kind release times and incompatible families to minimize makespan

  2017cites this paper
• Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time

  2016cites this paper
• Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart

  2015cites this paper
• Online Scheduling with Delivery Time on a Bounded Parallel Batch Machine with Limited Restart

  2015cites this paper
• Online unbounded batch scheduling on parallel machines with delivery times

  2014cites this paper
• Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart

  2014cites this paper
• Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan

  2014cites this paper
• A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines

  2014cites this paper
• Online Over Time Scheduling on Parallel-Batch Machines: A Survey

  2014cites this paper
• Online Algorithms for Batch Machines Scheduling with Delivery Times

  2013cites this paper
• Online and Semi-online Scheduling

  2013cites this paper
• A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints

  2012cites this paper
• Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead

  2012cites this paper
• DOCTEUR DE L'UNIVERSITÉ DE GRENOBLE

  2012cites this paper
• Online scheduling on unbounded parallel-batch machines with incompatible job families

  2011cites this paper
• An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times

  2011cites this paper
• Online batch scheduling on parallel machines with delivery times

  2011cites this paper
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time

  2011cites this paper
• The openshop batch processing problem with non-identical processing times, using simulated annealing and genetic algorithms approaches

  2011cites this paper
• Optimisation du chargement des laveurs dans un service de stérilisation

  2011cites this paper
• Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan

  2010cites this paper