221
Views
18
CrossRef citations to date
0
Altmetric
Original Articles

Multiple machine JIT scheduling: a tabu search approach

, &
Pages 4899-4915 | Received 17 May 2005, Accepted 08 Sep 2005, Published online: 26 Sep 2007

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

Read on this site (6)

Hamed Samarghandi & Tarek Y. ElMekkawy. (2012) A meta-heuristic approach for solving the no-wait flow-shop problem. International Journal of Production Research 50:24, pages 7313-7326.
Read now
Hadi Mokhtari, Ashkan Mozdgir & Isa Nakhai Kamal Abadi. (2012) A reliability/availability approach to joint production and maintenance scheduling with multiple preventive maintenance services. International Journal of Production Research 50:20, pages 5906-5925.
Read now
Jeffrey Schaller. (2012) Scheduling a permutation flow shop with family setups to minimise total tardiness. International Journal of Production Research 50:8, pages 2204-2217.
Read now
Rui Zhang & Cheng Wu. (2012) A double-layered optimisation approach for the integrated due date assignment and scheduling problem. International Journal of Production Research 50:1, pages 5-22.
Read now
D.E. Koulouriotis, A.S. Xanthopoulos & V.D. Tourassis. (2010) Simulation optimisation of pull control policies for serial manufacturing lines and assembly manufacturing systems using genetic algorithms. International Journal of Production Research 48:10, pages 2887-2912.
Read now

Articles from other publishers (12)

Ahmed Missaoui & Rubén Ruiz. (2022) A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows. European Journal of Operational Research 303:1, pages 99-113.
Crossref
Ankit Khare & Sunil Agrawal. (2019) Scheduling hybrid flowshop with sequence-dependent setup times and due windows to minimize total weighted earliness and tardiness. Computers & Industrial Engineering 135, pages 780-792.
Crossref
Quan-Ke Pan, Rubén Ruiz & Pedro Alfaro-Fernández. (2017) Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows. Computers & Operations Research 80, pages 50-60.
Crossref
Ruben Ruiz & Quan-Ke Pan. (2015) Simple greedy methods for scheduling hybrid flowshops with due date windows. Simple greedy methods for scheduling hybrid flowshops with due date windows.
Ola Jabali, Roel Leus, Tom Van Woensel & Ton de Kok. (2013) Self-imposed time windows in vehicle routing problems. OR Spectrum 37:2, pages 331-352.
Crossref
Maryam Ashrafi, Hamid Davoudpour & Mohammad Abbassi. 2014. Handbook of Research on Novel Soft Computing Intelligent Algorithms. Handbook of Research on Novel Soft Computing Intelligent Algorithms 538 567 .
Wei Weng & Shigeru Fujimura. (2012) Control methods for dynamic time-based manufacturing under customized product lead times. European Journal of Operational Research 218:1, pages 86-96.
Crossref
Wei Weng & Shigeru Fujimura. (2011) Study and application of scheduling method for just-in-time production in flexible job shops. Study and application of scheduling method for just-in-time production in flexible job shops.
Mohamed K. Omar, Teo S. C.Yasothei Suppiah. (2010) Mixed integer programming formulation for hybrid flow shop scheduling problem. Mixed integer programming formulation for hybrid flow shop scheduling problem.
Safa Khalouli, Fatima Ghedjati & Abdelaziz Hamzaoui. (2010) A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop. Engineering Applications of Artificial Intelligence 23:5, pages 765-771.
Crossref
Rubén Ruiz & José Antonio Vázquez-Rodríguez. (2010) The hybrid flow shop scheduling problem. European Journal of Operational Research 205:1, pages 1-18.
Crossref
Ola Jabali, Roel Leus, T. van Woensel & A.G. de Kok. (2010) Self-Imposed Time Windows in Vehicle Routing Problems. SSRN Electronic Journal.
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.