A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times

@article{Yuan2009ABO,
  title={A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times},
  author={Jinjiang Yuan and Shisheng Li and Ji Tian and Ruyan Fu},
  journal={J. Comb. Optim.},
  year={2009},
  volume={17},
  pages={206-213}
}
We consider a single batch machine on-line scheduling problem with delivery times. In this paper on-line means that jobs arrive over time and the characteristics of jobs are unknown until their arrival times. Once the processing of a job is completed it is delivered to the destination. The objective is to minimize the time by which all jobs have been delivered. For each job Jj , its processing time and delivery time are denoted by pj and qj , respectively. We consider two restricted models: (1… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

On-line algorithms for minimizing makespan on batch processing machines

  • GC Zhang, XQ Cai, CK Wong
  • Nav Res Logist
  • 2001
3 Excerpts

Minimizing makespan on a single batch processing machine with dynamic job arrivals

  • CY Lee, R Uzsoy
  • Int J Prod Res
  • 1999
2 Excerpts

Similar Papers

Loading similar papers…