Scheduling with dependent setups and maintenance in a textile company

@article{Chen2009SchedulingWD,
  title={Scheduling with dependent setups and maintenance in a textile company},
  author={Wei J Chen},
  journal={Computers & Industrial Engineering},
  year={2009},
  volume={57},
  pages={867-873}
}
This paper deals with a scheduling problem with machine maintenance in a textile company. In the production system, the sequence-dependent setup time of a job cannot be ignored when a switch between two different jobs occurs. This study presents a heuristic to minimize the completion time, or equivalently the total setup time subject to periodic maintenance and due dates. The performance of the heuristic is evaluated by comparing its solution with the solution of the branch-and-bound algorithm… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-9 OF 9 CITATIONS

Iterated Greedy Algorithm for Solving a New Single Machine Scheduling Problem

  • 2019 IEEE 16th International Conference on Networking, Sensing and Control (ICNSC)
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

On the single machine scheduling problem with sequence-dependent setup times and periodic maintenance

  • 2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)
  • 2018
VIEW 2 EXCERPTS
CITES BACKGROUND