176
Views
13
CrossRef citations to date
0
Altmetric
Articles

A generalisation model of learning and deteriorating effects on a single-machine scheduling with past-sequence-dependent setup times

, , &
Pages 804-813 | Received 02 Aug 2011, Accepted 30 Dec 2011, Published online: 01 Mar 2012

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (6)

Chin-Chia Wu, Danyu Bai, Ameni Azzouz, I.-Hong Chung, Shuenn-Ren Cheng, Dwueng-Chwuan Jhwueng, Win-Chin Lin & Lamjed Ben Said. (2020) A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration. Engineering Optimization 52:6, pages 1009-1036.
Read now
A. Azadeh, H. Habibnejad-Ledari, S. Abdolhossein Zadeh & M. Hosseinabadi Farahani. (2017) A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times. International Journal of Computer Integrated Manufacturing 30:2-3, pages 292-304.
Read now
Zhang Xingong, Wang Yong & Bai Shikun. (2016) Single-machine group scheduling problems with deteriorating and learning effect. International Journal of Systems Science 47:10, pages 2402-2410.
Read now
Paolo Renna. (2015) Deteriorating job scheduling problem in a job-shop manufacturing system by multi-agent system. International Journal of Computer Integrated Manufacturing 28:9, pages 936-945.
Read now
Yunqiang Yin, Wen-Hung Wu, T.C.E. Cheng & Chi-Chia Wu. (2015) Single-machine scheduling with time-dependent and position-dependent deteriorating jobs. International Journal of Computer Integrated Manufacturing 28:7, pages 781-790.
Read now
Wen-Hung Wu. (2014) Solving a two-agent single-machine learning scheduling problem. International Journal of Computer Integrated Manufacturing 27:1, pages 20-35.
Read now

Articles from other publishers (7)

Dirk Briskorn, Konrad Stephan & Nils Boysen. (2021) Minimizing the makespan on a single machine subject to modular setups. Journal of Scheduling 25:1, pages 125-137.
Crossref
Chin-Chia Wu, Win-Chin Lin, Xin-Gong Zhang, Dan-Yu Bai, Yung-Wei Tsai, Tao Ren & Shuenn-Ren Cheng. (2020) Cloud theory-based simulated annealing for a single-machine past sequence setup scheduling with scenario-dependent processing times. Complex & Intelligent Systems 7:1, pages 345-357.
Crossref
Mir Saber Salehi Mir, Javad Rezaeian & Hossein Mohamadian. (2019) Scheduling parallel machine problem under general effects of deterioration and learning with past-sequence-dependent setup time: heuristic and meta-heuristic approaches. Soft Computing 24:2, pages 1335-1355.
Crossref
Ali Allahverdi. (2015) The third comprehensive survey on scheduling problems with setup times/costs. European Journal of Operational Research 246:2, pages 345-378.
Crossref
Jin Young Choi. (2015) Minimizing total weighted completion time under makespan constraint for two-agent scheduling with job-dependent aging effects. Computers & Industrial Engineering 83, pages 237-243.
Crossref
Der-Chiang Li & Peng-Hsiang Hsu. (2013) Competitive Two-Agent Scheduling with Learning Effect and Release Times on a Single Machine. Mathematical Problems in Engineering 2013, pages 1-9.
Crossref
Yong He & Li Sun. (2012) Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times. Mathematical Problems in Engineering 2012, pages 1-9.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.