References  Liang Sun , Xiaochun Cheng, Yanchun Liang," Solving Job Shop Scheduling Problem Using Genetic Algorithm with Penalty Function" International Journal of Intelligent Information Processing Volume 1, Number 2, December 2010  Christian Bierwirth in his paper "A Generalized Permutation Approach to Job Shop Scheduling Problem with Genetic Algorithms"  Isao Ono Masayuki Yamamura Shigenobu Kobayashi in their paper, "A Genetic Algorithm for Job-shop Scheduling Problems Using Job-based Order Crossover" Proc.
What does JSSP stand for?
JSSP stands for Job-Shop Scheduling Problem
This definition appears somewhat frequently and is found in the following Acronym Finder categories:
- Science, medicine, engineering, etc.
See other definitions of JSSP
We have 8 other meanings of JSSP in our Acronym Attic
- Journal of Sports Science and Medicine
- Juvenile Segmental Spinal Muscular Atrophy
- Joint Summer Science and Mathematics Facility
- Joint Service System Management Office (Robins Air Force Base, GA; GPS laboratory)
- Jewish Sports and Social Network
- Journal of Surface Science and Nanotechnology
- JCALS (Joint Computer-Aided Acquisition and Logistics Support) Security Standard Operating Procedures
- Japanese Society of Sport Psychology (Chukyo University; Japan)
- Job Site Safety Plan
- Joint Security Systems Program
- Joint Stockpile Sampling Program
- Journal of Societal and Social Policy
- Justice Sector Support Program (Afghanistan; government consortium)
- Job Scheduling Strategies for Parallel Processing (conference)
- JiJi Self Service Password Reset (computer program)
- Japan Society for Science Policy and Research Management
- Japanese Society of Sleep Research
- Japanese Society of Stoma Rehabilitation (Asian Society of Stoma Rehabilitation)
- Jerusalem School of Synoptic Research (est. 1985; Israel and US)
Samples in periodicals archive:
Because the job-shop scheduling problem is a very difficult NP problem, it has captured the interest of a significant number of scientists.
Problems that were previously considered unsolvable --the airline crew selection problem mentioned previously and the job-shop scheduling problem from manufacturing--are being successfully attacked using supercomputer technology and sophisticated computational techniques.