<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05031195</id>
  <dt>j</dt>
  <an>05031195</an>
  <augroup>
    <au>Wu, Shuang</au>
    <au>Tang, Hengyong</au>
  </augroup>
  <ti>Single machine scheduling with start time dependent processing times.</ti>
  <so>J. Shenyang Norm. Univ., Nat. Sci. 23, No. 2, 108-111 (2005).</so>
  <py>2005</py>
  <pu>Editorial Department of Journal of Shenyang Normal University (Natural Sciences Edition), Shenyang, Liaoning</pu>
  <lagroup>
    <la>ZH</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>makespan</ut>
    <ut>flow time</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: This paper discusses a single machine scheduling problem with processing time depending on starting time for the queuing jobs. In this scheduling model, each job has a common processing time. There will be a time penalty for this job when the starting time falls behind a given common deadline. In this paper, the objective function is defined as the least-makespan and flow time, and polynomial algorithms are given for analyzing some special cases.</ab>
    <rv></rv>
  </abgroup>
</item>