diff --git a/src/squeue/opts.c b/src/squeue/opts.c
index e5626af24678a0e8b1f1a26d35da045893c90d26..8c97e20eaf5341800f4d554c2860cf530605284b 100644
--- a/src/squeue/opts.c
+++ b/src/squeue/opts.c
@@ -501,6 +501,7 @@ _print_options()
 	printf( "step_flag %d\n", params.step_flag );
 	printf( "jobs %s\n", params.jobs );
 	printf( "partitions %s\n", params.partitions ) ;
+	printf( "sort %s\n", params.sort ) ;
 	printf( "states %s\n", params.states ) ;
 	printf( "steps %s\n", params.steps );	
 	printf( "users %s\n", params.users );	
diff --git a/src/squeue/print.c b/src/squeue/print.c
index c78032ff5477ab2d004ccb02e29bf06b6d98ced9..3fbdda84ce2af5064256faf821f30f057565deaf 100644
--- a/src/squeue/print.c
+++ b/src/squeue/print.c
@@ -107,6 +107,8 @@ int print_jobs_array(job_info_t * jobs, int size, List format)
 				continue;
 			else if (params.sort[i] == 'i')
 				sort_job_by_job_id(job_list);
+			else if (params.sort[i] == 'j')
+				sort_job_by_job_name(job_list);
 			else if (params.sort[i] == 'p')
 				sort_job_by_priority(job_list);
 			else if (params.sort[i] == 'P')
@@ -948,6 +950,15 @@ int _sort_job_by_id(void *void1, void *void2)
 	return job1->job_id - job2->job_id;
 }
 
+/* sort lower to higher */
+int _sort_job_by_name(void *void1, void *void2)
+{
+	job_info_t *job1 = (job_info_t *) void1;
+	job_info_t *job2 = (job_info_t *) void2;
+
+	return strcmp(job1->name, job2->name);
+}
+
 /* sort higher to lower */
 int _sort_job_by_priority(void *void1, void *void2)
 {
diff --git a/src/squeue/print.h b/src/squeue/print.h
index e03cb95a2122847472acc3cffc49aa3033056bf2..b8c1eaf95145430e0b8e07b0663d203b1ffdb444 100644
--- a/src/squeue/print.h
+++ b/src/squeue/print.h
@@ -216,6 +216,8 @@ int _print_step_nodes(job_step_info_t * step, int width,
  *****************************************************************************/
 #define sort_job_by_job_id(list) \
 		list_sort(list,_sort_job_by_id)
+#define sort_job_by_job_name(list) \
+		list_sort(list,_sort_job_by_name)
 #define sort_job_by_priority(list) \
 		list_sort(list,_sort_job_by_priority)
 #define sort_job_by_partition(list) \
@@ -226,6 +228,7 @@ int _print_step_nodes(job_step_info_t * step, int width,
 		list_sort(list,_sort_job_by_user)
 
 int _sort_job_by_id(void *void1, void *void2);
+int _sort_job_by_name(void *void1, void *void2);
 int _sort_job_by_priority(void *void1, void *void2);
 int _sort_job_by_partition(void *void1, void *void2);
 int _sort_job_by_state(void *void1, void *void2);